Bounded-graph construction for noncanonical discriminating-reverse parsers

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

Volumn 2494, Issue , 2002, Pages 101-114

  Farré, Jacques ^a   Gàlvez, José Fortes ^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

AUTOMATA THEORY; ROBOTS;

GRAPH CONSTRUCTION; LOOPING APPROACHES; NEW APPROACHES; NEW FORMS; PARSING ALGORITHM; SUBGRAPHS;

GRAPH ALGORITHMS;

EID: 84945293392     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36390-4_9     Document Type: Conference Paper

References (10)

1. Manuel E. Bermudez and Karl M. Schimpf. Practical arbitraryl ookahead LR parsing. Journal of Computer and System Sciences, 41: 230-250, 1990.
2. Pierre Boullier. Contribution à la construction automatique d'analyseurs lexicographiques et syntaxiques. PhD thesis, Université d'Orléans, France, 1984. In French.
3. Jacques Farré and José Fortes Gálvez. A basis for looping extensions to discriminating-reverse parsing. In M. Daley, M.G. Eramian, and S. Yu, editors, 5th International Conference on Implementation and Applications of Automata, CIAA 2000, pages 130-139, London, Ontario, 2000. The Universityof Western Ontario.
4. Jacques Farré and José Fortes Gálvez. A bounded-connect construction for LRregular parsers. In R. Wilhelm, editor, International Conference on Compiler Construction, CC 2001, Lecture Notes in Computer Science #2027, pages 244-258. Springer-Verlag, 2001.
5. José Fortes Gálvez. Generating LR(1) parsers of small size. In Compiler Construction. 4th Internatinal Conference, CC'92, Lecture Notes in Computer Science #641, pages 16-29. Springer-Verlag, 1992.
6. José Fortes Gálvez. Experimental results on discriminating-reverse LR(1) parsing. In Peter Fritzson, editor, Proceedings of the Poster Session of CC'94 - International Conference on Compiler Construction, pages 71-80. Department of Computer and Information Science, Linköping University, March 1994. Research report LiTH-IDA-R-94-11.
7. José Fortes Gálvez. A practical small LR parser with action decision through minimal stack suffix scanning. In Jürgen Dassow, G. Rozenberg, and A. Salomaa, editors, Developments in Language Theory II, pages 460-465. World Scientific, 1996.
8. José Fortes Gálvez. A Discriminating Reverse Approach to LR(k) Parsing. PhD thesis, Universidad de Las Palmas de Gran Canaria and Université de Nice-Sophia Antipolis, 1998.
9. B. Seité. A Yacc extension for LRR grammar parsing. Theoretical Computer Science, 52: 91-143, 1987.
10. Seppo Sippu and Eljas Soisalon-Soininen. Parsing Theory. Springer, 1988 and 1990.