Noncanonical LALR(1) parsing

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

Volumn 4036 LNCS, Issue , 2006, Pages 95-107

  Schmitz, Sylvain ^a  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL METHODS; FORMAL LANGUAGES; INFORMATION TECHNOLOGY; PROBLEM SOLVING;

GRAMMAR CLASSES; NONCANONICAL PARSERS; NONDETERMINISTIC LANGUAGES; PARSER GENERATORS;

COMPUTER SCIENCE;

EID: 33746215785     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11779148_10     Document Type: Conference Paper

References (15)

1. Johnson, S.C.: YACC - yet another compiler compiler. Computing science technical report 32, AT&T Bell Laboratories, Murray Hill, New Jersey (1975)
2. Earley, J.: An efficient context-free parsing algorithm, Communications of the ACM 13(2) (1970) 94-102
3. Tomita, M.: Efficient Parsing for Natural Language. Kluwer Academic Publishers (1986)
4. Szymanski, T.G., Williams, J.H.: Noncanonical extensions of bottom-up parsing techniques. SIAM Journal on Computing 5(2) (1976) 231-250
5. Tai, K.C.: Noncanonical SLR(1) grammars. ACM Transactions on Programming Languages and Systems 1(2) (1979) 295-320
6. Charles, P.: A Practical method for Constructing Efficient LALR(k) Parsers with Automatic Error Recovery. PhD thesis, New York University (1991)
7. Čulik, K., Cohen, R.: LR-Regular grammars - an extension of LR(k) grammars. Journal of Computer and System Sciences 7 (1973) 66-96
8. Bermudez, M.E., Schimpf, K.M.: Practical arbitrary lookahead LR parsing. Journal of Computer and System Sciences 41(2) (1990) 230-250
9. 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
10. Farré, J., Fortes Gálvez, J.: Bounded-connect noncanonical discriminating-reverse parsers. Theoretical Computer Science 313(1) (2004) 73-91
11. DeRemer, F., Pennello, T.: Efficient computation of LALR(1) look-ahead sets. ACM Transactions on Programming Languages and Systems 4(4) (1982) 615-649
12. Schmitz, S.: Noncanonical LALR(1) parsing. Technical Report I3S/RR-2005-21-FR, Laboratoire I3S (2005) URL http://www.i3s.unice.fr/~mh/RR/ 2005/RR-05.21-S.SCHMITZ.pdf.
13. 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)
14. Sippu, S., Soisalon-Soininen, E.: Parsing Theory. Volume II: LR(k) and LL(k) Parsing of EATCS Monographs on Theoretical Computer Science. Springer (1990)
15. Tarjari, R.E.: Depth first search and linear graph algorithms. SIAM Journal on Computing 1(2) (1972) 146-160