Practical nondeterministic DR(k) parsing on graph-structured stack

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

Volumn 2004, Issue , 2001, Pages 411-422

  Gálvez, José Fortes ^a,b   Farré, Jacques ^b   Aguiar, Miguel Ángel Pérez ^a  

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

^b UNIVERSITÉ CÔTE D'AZUR   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; FORESTRY; GRAPHIC METHODS; LINGUISTICS; TEXT PROCESSING;

GENERATION ALGORITHM; LR PARSERS; NEW APPROACHES; NON-DETERMINISM; NUMBER OF STATE;

ALGORITHMS;

EID: 84947725897     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (15)

1. J. Farré. Discriminating-reverse LR parsing of context-free grammars. In J. Carroll, editor, Proceedings of the Sixth International Workshop on Parsing Technologies, IWPT 2000, pages 303-304, Trento, Italy, 2000. ITC-irst.
2. J. Farré and J. Fortes Gálvez. A basis for looping extensions to discriminatingreverse parsing. In M. Daley, M. G. Eramian, and S. Yu, editors, 5th International Conference on Implementation and Applications of Automata, CIAA 2000, to appear in Lecture Notes in Computer Science. Springer-Verlag, 2000.
3. J. 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.
4. J. Fortes Gálvez. Experimental results on discriminating-reverse LR(1) parsing. In P. 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, Mar. 1994. Research report LiTH-IDAR-94-11.
5. J. Fortes Gálvez. A practical small LR parser with action decision through minimal stack suffix scanning. In J. Dassow, editor, Developments in Language Theory II: at the Crossroads ot Mathematics, Computer Science and Biology, Singapore, 1996. World Scientific. Proceedings of Conference, Magdeburg, Germany 17-21 July 1995.
6. J. 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.
7. J. Fortes Gálvez and J. Farré. Towards a discriminating-reverse Tomita-like parser with reduced nondeterminism. Procesamiento del Lenguaje Natural, 24: 111-118, Sept. 2000.
8. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
9. D. E. Knuth. On the translation of languages from left to right. Information and Control, 8(6): 607-639, 1965.
10. S. Mateo González. Eficiencia de implementación del método LR inverso. Computing undergraduate thesis, University of Las Palmas de Gran Canaria, Spain, Sept. 2000. In Spanish.
11. M. J. Nederhof and J. J. Sarbo. Increasing the applicability of LR parsing. In H. Bunt and M. Tomita, editors, Recent Advances in Parsing Technology, pages 35-57. Kluwer Academic Publishers, Boston, 1996.
12. R. Nozohoor-Farshi. Handling of ill-designed grammars in Tomita's parsing algorithm. In International Workshop on Parsing Technologies, pages 182-192, 1989.
13. S. Sippu and E. Soisalon-Soininen. Parsing Theory. Springer-Verlag, 1988-1990.
14. M. Tomita. Efficient Parsing for Natural Language. Kluwer Academic Publishers, Boston, 1986.
15. M. Tomita. The generalized parsing algorithm. In M. Tomita, editor, Generalized LR Parsing, pages 1-16. Kluwer Academic Publishers, Boston, 1991.