A bounded graph-connect construction for lr-regular parsers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2027, Issue , 2001, Pages 244-258

  Farré, Jacques ^a   Gálvez, José Fortes ^a,b  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

^b UNIVERSITY OF LAS PALMAS DE GRAN CANARIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAM COMPILERS;

CONFLICT RESOLUTION; CONNECT TECHNIQUE; DEPENDENCE GRAPHS; PARSER GENERATION; REGULAR GRAMMAR;

COMPUTATIONAL LINGUISTICS;

EID: 84958958152     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45306-7_17     Document Type: Conference Paper

References (19)

1. J. Aycock and R. N. Horspool.Faster generalized LR parsing. In S. Jahnichen, editor, Compiler Construction. 8th International Conference, CC’99, Lecture Notes in Computer Science #1575, pages 32-46. Springer, 1999.
2. T. P. Baker. Extending look-ahead for LR parsers. J. Comput. Syst. Sci., 22(2):243-259, 1981.
3. M. E. Bermudez and K. M. Schimpf. Practical arbitrary lookahead LR parsing. Journal of Computer and System Sciences, 41:230-250, 1990.
4. P. Boullier. Contribution à la construction automatique d’analyseurs lexicogra- phiques et syntaxiques. PhD thesis, Université d’Orléans, France, 1984. In French.
5. K. Čulik II and R. Cohen. LR-regular grammars — an extension of LR(fc) grammars. J. Comput. Syst. Sci., 7:66-96, 1973.
6. J. Earley. An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94-102, Feb. 1970.
7. J. Farré and J. Fortes Gálvez.A basis for looping extensions to discriminating- reverse parsing. In S. Yu, editor, Fifth International Conference on Implementation and Application of Automata, CIAA 2000. To appear in LNCS. Springer.
8. J. Gosling, B. Joy, and G. Steele. The Java™ Language Specification. Addison- Wesley, 1996.
9. D. Grune and C. J. H. Jacobs. A programmer-friendly LL(1) parser generator. Software—Practice and Experience, 18(1):29-38, Jan. 1988.
10. S. Heilbrunner. A parsing automata approach to LR theory. Theoretical Computer Science, 15:117-157, 1981.
11. A. Johnstone and E. Scott.Generalised recursive descent parsing and follow- determinism. In K. Koskimies, editor, Compiler Construction. 7th International Conference, CC’98, Lecture Notes in Computer Science #1383, pages 16-30. Springer, 1998.
12. B. Lang.Deterministic techniques for efficient non-deterministic parsers. In J. Loeckx, editor, Automata, Languages and Programming, Lecture Notes in Computer Science #14, pages 255-269. Springer, 1974.
13. T. J. Parr. We are talking really big lexical lookahead here. www.antlr.org/articles.html.
14. T. J. Parr and R. W. Quong. ANTLR: A predicated-LL(fc) parser generator. Software—Practice and Experience, 25(7):789-810, July 1995.
15. B. Seité. A Yacc extension for LRR grammar parsing. Theoretical Computer Science, 52:91-143, 1987.
16. S. Sippu and E. Soisalon-Soininen. Parsing Theory. Springer, 1988-1990.
17. T. G. Szymanski and J. H. Williams. Non-canonical extensions of bottom-up parsing techniques. SIAM J. Computing, 5(2):231-250, June 1976.
18. M. Tomita. Efficient Parsing for Natural Language. Kluwer, 1986.
19. T. A. Wagner and S. L. Graham. Incremental analysis of real programming languages. ACM SIGPLAN Notices, 32(5):31-43, 1997.