Shift-resolve parsing: Simple, unbounded lookahead, linear time

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

Volumn 4094 LNCS, Issue , 2006, Pages 253-264

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

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

^b UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; CONTEXT SENSITIVE GRAMMARS;

DETERMINISTIC PARSER; LINEAR TIME COMPLEXITY; NONDETERMINISTIC AUTOMATON; SHIFT-RESOLVE PARSERS;

LINEAR SYSTEMS;

EID: 33749392352     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11812128_24     Document Type: Conference Paper

References (17)

1. Donnely, C., Stallman, R.: Bison, The YACC-compatible Parser Generator. The Free Software Foundation (2002)
2. Baker, T.P.: Extending lookahead for LR parsers. Journal of Computer and System Sciences 22(2) (1981) 243-259
3. Bermudez, M.E., Schimpf, K.M.: Practical arbitrary lookahead LR parsing. Journal of Computer and System Sciences 41(2) (1990) 230-250
4. Farré, J., Fortes Gálvez, J.: A bounded-connect construction for LR-regular parsers. In Wilhelm, R., ed.: CC'01. Volume 2027 of Lecture Notes in Computer Science., Springer (2001) 244-258
5. Szymanski, T.G., Williams, J.H.: Noncanonical extensions of bottom-up parsing techniques. SIAM Journal on Computing 5(2) (1976) 231-250
6. Tai, K.C.: Noncanonical SLR(1) grammars. ACM Transactions on Programming Languages and Systems 1(2) (1979) 295-320
7. Schmitz, S.: Noncanonical LALR(1) parsing. In Dang, Z., Ibarra, O.H., eds.: DLT'06. Volume 4036 of Lecture Notes in Computer Science., Springer (2006) 95-107
8. Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling. Volume I: Parsing of Series in Automatic Computation. Prentice Hall, Englewood Cliffs, New Jersey (1972)
9. Tomita, M.: Efficient Parsing for Natural Language. Kluwer Academic Publishers (1986)
10. Culik, K., Cohen, R.: LR-Regular grammars - an extension of LR(k) grammars. Journal of Computer and System Sciences 7 (1973) 66-96
11. Farré, J., Fortes Gálvez, J.: Bounded-connect noncanonical discriminating-reverse parsers. Theoretical Computer Science 313(1) (2004) 73-91
12. Fortes Gálvez, J.: A Discriminating Reverse Approach to LR(k) Parsing. PhD thesis, Universidad de Las Palmas de Gran Canaria and Université de Nice-Sophia Antipolis (1998)
13. Grune, D., Jacobs, C.J.H.: Parsing Techniques: A Practical Guide. Ellis Horwood Limited (1990)
14. Hunt, III, H.B., Szymanski, T.G., Ullman, J.D.: On the complexity of LR(k) testing. Communications of the ACM 18(12) (1975) 707-716
15. Heilbrunner, S.: A parsing automata approach to LR theory. Theoretical Computer Science 15(2) (1981) 117-157
16. Schöbel-Theuer, T.: Towards a unifying theory of context-free parsing. In Pighizzini, G., San Pietro, P., eds.: Proceedings ASMICS Workshop on Parsing Theory. Technical Report 126-1994, Université di Milano (1994) 89-100
17. Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL '77, ACM Press (1977) 238-252