Bounded-connect noncanonical discriminating-reverse parsers

Theoretical Computer Science

Volumn 313, Issue 1, 2004, Pages 73-91

  Farré, Jacques ^a   Fortes Galvez J ^b  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

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

Author keywords

Conflict resolution; Discriminating reverse; Item graph; Noncanonical; Two stacks; Unbounded lookahead

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL GRAMMARS; GRAPH THEORY;

CONFLICT RESOLUTION; DISCRIMINATING REVERSE PARSERS; ITEM GRAPH;

FORMAL LANGUAGES;

EID: 0742285801     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.10.006     Document Type: Conference Paper

References (17)

1. Aho A.V., Ullman J.D. The Theory of Parsing, Translation and Compiling. 1972-1973;Prentice-Hall, Englewood Cliffs, NJ.
2. Bermudez M.E., Schimpf K.M. Practical arbitrary lookahead LR parsing. J. Comput. System Sci. 41:1990;230-250.
3. P. Boullier, Contribution à la construction automatique d'analyseurs lexico-graphiques et syntaxiques, Thèse d'État, Université d'Orléans, France, 1984.
4. J. Farré, Sur quelques aspects théoriques et pratiques de la compilation, Habilitation à Diriger des Recherches, Université de Nice-Sophia Antipolis, France, 2001.
5. Farré J., Fortes Gálvez J. A basis for looping extensions to discriminating-reverse parsing. Yu S., Paun A. Implementation and Applications of Automata, 5th Internat. Conf., CIAA 2000. Lecture Notes in Computer Science. Vol. 2088:2001;122-134 Springer, Berlin.
6. Farré J., Fortes Gálvez J. A bounded-connect construction for LR-regular parsers. Wilhelm R. Compiler Construction, 10th Internat. Conf., CC 2001. Lecture Notes in Computer Science. Vol. 2027:2001;244-258 Springer, Berlin.
7. Farré J., Fortes Gálvez J. Bounded-graph construction for noncanonical discriminating-reverse parsers. Watson B., Wood D. Implementation and Applications of Automata, 6th Internat. Conf., CIAA 2001. Lecture Notes in Computer Science. Vol. 2494:2002;101-114 Springer, Berlin.
8. Fortes Gálvez J. Generating LR(1) parsers of small size. Kastens U., Pfahler P. Compiler Construction, 4th Internat. Conf., CC'92. Lecture Notes in Computer Science. Vol. 641:1992;16-29 Springer, Berlin.
9. Fortes Gálvez J. A practical small LR parser with action decision through minimal stack suffix scanning. Dassow J., Rozenberg G., Salomaa A. Developments in Language Theory II. 1996;460-465 World Scientific, Singapore.
10. J. Fortes Gálvez, A discriminating reverse approach to LR(k) parsing, Ph.D. Thesis, Universidad de Las Palmas de Gran Canaria and Université de Nice-Sophia Antipolis, 1998.
11. Grune D., Jacobs C.J.H. Parsing Techniques: A Practical Guide. 1990;Ellis Horwood, Chichester.
12. S.C. Johnson, Yacc - yet another compiler compiler, Computing Science Technical Report 32, AT&T Bell Laboratories, Murray Hill, NJ, 1975.
13. Parr T.J., Quong R.W. ANTLR. A predicated-LL( k ) parser generator Software - Practice & Experience. 25(7):1995;789-810.
14. Seité B. A Yacc extension for LRR grammar parsing. Theoret. Comput. Sci. 52:1987;91-143.
15. Sippu S., Soisalon-Soininen E. Parsing Theory. 1988, 1990;Springer, Berlin.
16. Szymanski T.G., Williams J.H. Noncanonical extensions of bottom-up parsing techniques. SIAM J. Comput. 5(2):1976;231-250.
17. Tai K.-C. Noncanonical SLR(1) grammars. TOPLAS. 1(2):1979;295-320.