Efficient and flexible incremental parsing

ACM Transactions on Programming Languages and Systems

Volumn 20, Issue 5, 1998, Pages 980-1013

  Wagner, Tim A ^a,b   Graham, Susan L ^a,c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Borland Inc   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

D.2.6 Software Engineering : Programming Environments interactive; D.2.7 Software Engineering : Distribution and Maintenance version control

Indexed keywords

ALGORITHMIC LANGUAGES; PROGRAM COMPILERS; PROGRAM TRANSLATORS;

INCREMENTAL PARSING;

SOFTWARE ENGINEERING;

EID: 0032153740     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/293677.293678     Document Type: Article

References (36)

1. AASA, A. 1995. Precedences in specifications and implementations of programming languages. Theor. Comput. Sci. 142, 1 (May), 3-26.
2. AGRAWAL, R. AND DETRO, K. D. 1983. An efficient incremental LR parser for grammars with epsilon productions. Acta Inf. 19, 369-376.
3. AHO, A. V., JOHNSON, S. C., AND ULLMAN, J. D. 1975. Deterministic parsing of ambiguous grammars. Commun. ACM 18, 8 (Aug.), 441-452.
4. AHO, A. V., SETHI, R., AND ULLMAN, J. D. 1986. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, Mass.
5. BALLANCE, R. A., BUTCHER, J., AND GRAHAM, S. L. 1988. Grammatical abstraction and incremental syntax analysis in a language-based editor. In Proceedings of the ACM SIGPLAN '88 Symposium on Compiler Construction. ACM Press, New York, 185-198.
6. BEETEM, J. F. AND BEETEM, A. F. 1991. Incremental scanning and parsing with Galaxy. IEEE Trans. Softw. Eng. 17, 7 (July), 641-651.
7. BURKE, M. G. AND FISHER, G. A. 1987. A practical method for LR and LL syntactic error diagnosis and recovery. ACM Trans. Program. Lang. Syst. 9, 2 (Apr.), 164-197.
8. CORBETT, R. 1992. bison release 1.24. Free Software Foundation, Inc., 675 Mass Ave., Cambridge, MA 02139.
9. DEGANO, P., MANNUCCI, S., AND MOJANA, B. 1988. Efficient incremental LR parsing for syntax-directed editors. ACM Trans. Program. Lang. Syst. 10, 3 (July), 345-373.
10. GAFTER, N. M. 1990. Parallel incremental compilation. Ph.D. thesis, University of Rochester, Rochester, N.Y.
11. GHEZZI, C. AND MANDRIOLI, D. 1980. Augmenting parsers to support incrementality. J. ACM 27, 3 (July), 564-579.
12. HEDIN, G. 1992. Incremental semantic analysis. Ph.D. thesis, Department of Computer Science, Lund University.
13. HEERING, J., HENDRIKS, P. R. H., KLINT, P., AND REKERS, J. 1992. The syntax definition formalism SDF - Reference Manual. ASF+SDF Project.
14. HEILBRUNNER, S. 1979. On the definition of ELR(k) and ELL(k) grammars. Acta Inf. 11, 169-176.
15. JALILI, F. AND GALLIER, J. H. 1982. Building friendly parsers. In Proceedings of the 9th ACM Symposium on the Principles of Programming Languages. ACM Press, New York, 196-206.
16. KLINT, P. AND VISSER, E. 1994. Using filters for the disambiguation of context-free grammars. In Proceedings of the ASMICS Workshop on Parsing Theory.
17. LALONDE, W. R. 1977. Regular right part grammars and their parsers. Commun. ACM 20, 10, 731-740.
18. LARCHEVÊQUE, J. M. 1995. Optimal incremental parsing. ACM Trans. Program. Lang. Syst. 17, 1, 1-15.
19. LI, W. X. 1995a. A simple and efficient incremental LL(1) parsing. In SOFSEM '95: Theory and Practice of Informatics (Milovy, Czech Republic). Lecture Notes in Computer Science. Springer-Verlag, Berlin, 399-404.
20. LI, W. X. 1995b. Towards generating practical language-based editing systems. Ph.D. thesis, University of Western Australia.
21. MADDOX, W. 1997. Incremental static semantic analysis. Ph.D. thesis, University of California, Berkeley. Tech. Rep. UCB/CSD-97-948.
22. MAVERICK, V. 1997. Presentation by tree transformation. Ph.D. thesis, University of California, Berkeley. Tech. Rep UCB/CSD-97-947.
23. MURCHING, A. M., PRASAD, Y. V., AND SRIKANT, Y. N. 1990. Incremental recursive descent parsing. Comput. Lang. 15, 4, 193-204.
24. PETRONE, L. 1995. Reusing batch parsers as incremental parsers. In Proceeding of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science (Bangalore, India). Lecture Notes in Computer Science, vol. 1026. Springer-Verlag, Berlin, 111-123.
25. REPS, T. W. AND TEITELBAUM, T. 1989. The Synthesizer Generator: A System for Constructing Language-Based Editors. Springer-Verlag, Berlin.
26. SASSA, M. AND NAKATA, I. 1987. A simple realization of LR-parsers for regular right part grammars. Inf. Proc. Lett. 24, 113-120.
27. SHILLING, J. J. 1992. Incremental LL(1) parsing in language-based editors. IEEE Trans. Softw. Eng. 19, 9 (Sept.), 935-940.
28. TARJAN, R. E. 1983. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, Pa.
29. THORUP, M. 1994. Controlled grammatic ambiguity. ACM Trans. Program. Lang. Syst. 16, 3 (May), 1024-1050.
30. VAN DE VANTER, M. L., GRAHAM, S. L., AND BALLANCE, R. A. 1992. Coherent user interfaces for language-based editing systems. Int. J. Man-Machine Stud. 37, 431-466.
31. VISSER, E. 1995. A case study in optimizing parsing schemata by disambiguation filters. Tech. Rep. P9507, Programming Research Group, University of Amsterdam. July.
32. WAGNER, T. A. 1997. Practical algorithms for incremental software development environments. Ph.D. thesis, University of California, Berkeley. Tech. Rep. UCB/CSD-97-946.
33. WAGNER, T. A. AND GRAHAM, S. L. 1997. Efficient self-versioning documents. In CompCon '97. IEEE Computer Society Press, Los Alamitos, Calif., 62-67.
34. WEGMAN, M. N. 1980. Parsing for structural editors. In Proceeding of the 21st Annual IEEE Symposium on Foundations of Computer Science. IEEE Press, New York, 320-327.
35. YANG, W. 1994. Incremental LR parsing. In 1994 International Computer Symposium Conference Proceedings vol. 1. National Chiao Tung University, Hsinchu, Taiwan, 577-583.
36. YEH, D. AND KASTENS, U. 1988. Automatic construction of incremental LR(1) parsers. ACM SIGPLAN Not. 23, 3 (Mar.), 33-42.