This Article 
 Bibliographic References 
 Add to: 
Incremental Generation of Parsers
December 1990 (vol. 16 no. 12)
pp. 1344-1351

An LR-based parser generator for arbitrary context-free grammars that generates parsers by need and handles modifications to its input grammar by updating the parser it has generated so far is described. The need for these techniques is discussed in the context of interactive language definition environments. All required algorithms are presented. Measurements are given comparing their performance with that of conventional techniques.

[1] J. Heering, P. Klint, and J. Rekers, "Incremental generation of parsers,"ACM SIGPLAN Notices (SIGPLAN'89 Conf. Programming Language Design and Implementation), vol. 24, no. 7, pp. 179-191, 1989.
[2] D. Sandberg, "LITHE: a language combining a flexible syntax and classes," inProc. Assoc. Comput. Mach. Symp. Principles Programming Languages, Albuquerque, NM, 1982, pp. 142-145.
[3] K. Futatsugi, J. Goguen, J.-P. Jouannaud, and J. Meseguer, "Principles of OB J2," inProc. Twelfth Symp. Principles of Programming Languages, ACM, 1985, pp. 52-66.
[4] F. Voisin, "CIGALE: A tool for interactive grammar construction and expression parsing,"Sci. Comput. Program., vol. 7, pp. 61-86, 1986.
[5] F.J.H. Boinck and H. van Tilborg, "Constructions and bounds for systematictEC/AUED codes,"IEEE Trans. Inform. Theory, vol. IT-36, pp. 1381-1390, Nov. 1990.
[6] J. Heering, P. Klint, and J. Rekers, "Principles of lazy and incremental program generation," Centre for Mathematics and Computer Science, Amsterdam, The Netherlands, Rep. CS-R8749, 1987.
[7] J. Heering, P. Klint, and J. Rekers, "Incremental generation of lexical scanners," Centre for Mathematics and Computer Science, Amsterdam, The Netherlands, Rep. CS-R8761, 1987; to appear inACM Trans. Program. Lang. Syst.
[8] J. Heering, P. R. H. Hendriks, P. Klint, and J. Rekers, "The syntax definition formalism SDF--Reference manual,"ACM SIGPLAN Notices, vol. 24, no. 11, pp. 43-75, 1989.
[9] A. V. Aho, R. Sethi, and J. D. Ullman,Compilers: Principles, Techniques, and Tools. Reading, MA: Addison-Wesley, 1986.
[10] J. Earley, "An efficient context-free parsing algorithm,"Commun. ACM, vol. 13, no. 2, pp. 94-102, 1970.
[11] B. Lang, "Deterministic techniques for efficient nondeterministic parsers," inProc. Second Colloquium Automata, Languages and Programming(Lecture Notes in Computer Science, vol. 14) J. Loeckx, Ed. New York: Springer-Verlag, 1974, pp. 255-269.
[12] M. Tomita,Efficient Parsing for Natural Languages. New York: Kluwer Academic, 1985.
[13] R. N. Horspool, "Incremental generation of LR parsers," Univ. Victoria, Victoria, B.C., Canada, Rep. DCS-79-IR, 1988.
[14] J. Rekers, "A parser generator for finitely ambiguous context-free grammars," inAlgebraic Specification, J. A. Bergstra, J. Heering, and B. Klint, Eds. New York: ACM Press Frontier Series (ACM Press in cooperation with Addison-Wesley), 1989, ch. 8.
[15] S. C. Johnson, "YACC: Yet another compiler-compiler," inUNIX Programmer's Supplementary Documents, Volume 1 (PS1), AT&T Bell Laboratories, 1986.
[16] LeLisp, Version 15.21, le Manuel de Référence, INRIA, Rocquencourt, France, 1987.
[17] J. Rekers, "Modular parser generation," Centre for Mathematics and Computer Science, Amsterdam, The Netherlands, Rep. CS- R8933, 1989.

Index Terms:
incremental parser generation; LR-based parser generator; arbitrary context-free grammars; input grammar; interactive language definition environments; algorithms; performance; conventional techniques; context-free grammars; program compilers
J. Heering, P. Klint, J. Rekers, "Incremental Generation of Parsers," IEEE Transactions on Software Engineering, vol. 16, no. 12, pp. 1344-1351, Dec. 1990, doi:10.1109/32.62443
Usage of this product signifies your acceptance of the Terms of Use.