Construction of efficient generalized LR parsers

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

Volumn 1436, Issue , 1998, Pages 7-24

  Alonso, Miguel A ^a   Cabrero, David ^b   Vilares, Manuel ^a  

^a UNIVERSITY OF A CORUÑA   (Spain)

^b Centro de Investigaci ns Lingüísticas e Literarias Ram n Piñeiro   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; CONTEXT FREE GRAMMARS;

GENERALIZED LR PARSING; LINEAR COMPLEXITY; LR PARSERS; PARSING ALGORITHM;

DYNAMIC PROGRAMMING;

EID: 84956858076     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0031377     Document Type: Conference Paper

References (16)

1. Aho, A V., Ullman, J.D.: The theory of parsing, translation and compiling. Prentice Hall (1972)
2. Donnelly, C., Stallman, R. M.: Bison reference manual. Free Software Foundation, Inc., 675 Mass Avenue, Cambridge, MA 02139, USA, 1.20 edition (1992)
3. Earley, J.: An efficient context-free parsing algorithm. Communications of the ACM 13 (1970) 94-102
4. Hearing, J., Hendriks, P. R. H., Klint, P., Rekers, J.: The syntax definition formalism SDF - reference manual. SIGPLAN Notices 24 (1989) 43-75
5. Lang, B.: Towards a uniform formal framework for parsing. In Tomita, M. (ed.): Current Issues in Parsing Technology. Kluwer Academic Publishers (1991) 153-171
6. McLean, P., Horspool, R.N.: A faster Earley parser. Proc. of International Conference on Compiler Construction (1996) 281-293
7. Nederhof, M.-J., Sarbo, J. J.: Increasing the applicability of LR parsing. Proc. of Third International Workshop on Parsing Technologies (1993) 187-201
8. Pereira, F. C.N., Warren, D. H. D.: Definite Clause Grammars for language analysis - a survey of the formalism and a comparison with Augmented Transition Networks. Artificial Intelligence 13 (1980) 231-278
9. Rekers, J.: Parsing Generation for Interactive Environments. PhD thesis. University of Amsterdam (1992)
10. Sheil, B. A.: Observations on context-free grammars. Proc. of Statistical Methods in Linguistics (1976) 71-109
11. Shieber, S. M., Schabes, Y., Pereira, F. C.N.: Principles and implementation of deductive parsing. Journal of Logic Programming 24 (1995) 3-36
12. Sikkel, K.: Parsing Schemata - A Framework for Specification and Analysis of Parsing Algorithms. Texts in Theoretical Computer Science - An EATCS Series. Springer-Verlag (1997)
13. Tomita, M.: Efficient Parsing for Natural Language. Kluwer Academic Publishers (1986)
14. Vilaxes Ferro, M., Alonso Pardo, M. A.: An LALR extension for DCGs in dynamic programming. In Martín Vide, C. (ed.): Mathematical Linguistics, vol. II. John Benjamins Publishing Company (to appear)
15. th IEEE International Conference on Computer Languages (1994) 241-252
16. de la Clergerie, Villemonte E.: Automates à Piles et Programmation Dynamique. DyALog: Une Application à la Programmation en Logique. PhD thesis. Université Paris 7 (1993)