Parsing techniques: A practical guide

Parsing Techniques: A Practical Guide

Volumn , Issue , 2008, Pages 1-662

  Grune, Dick ^a   Jacobs, Ceriel J H ^a  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84892197664     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-0-387-68954-8     Document Type: Book

References (421)

1. Tanaka, Eiichi and Fu, King-Sun. Error-correcting parsers for formal languages. IEEE Trans. Comput., C-27(7):605-616. July 1978
2. Irons, E. T. A syntax-directed compiler for ALGOL 60. Commun. ACM, 4(1):51-55, Jan. 1961.
3. B.H. Mayoh, Commun. ACM, 4(6):284, June 1961.
4. Hays, David G. Automatic language-data processing. In H. Borko, editor, Computer Applications in the Behavioral Sciences, pages 394-423. Prentice-Hall, 1962.
5. Kuno, S. and Oettinger, A. G. Multiple-path syntactic analyzer. In Information Processing 1962, pages 306-312, Amsterdam, 1962. North-Holland.
6. Sakai, Itiroo. Syntax in universal translation. In 1961 International Conference on Machine Translation of Languages and Applied Language Analysis, pages 593-608, London, 1962.
7. Greibach, S. A. Inverses of Phrase Structure Generators. PhD thesis, Technical Report NSF-11, Harvard U., Cambridge, Mass., 1963.
8. Greibach, Sheila A. Formal parsing systems. Commun. ACM, 7(8):499-504, Aug. 1964.
9. Greibach, S. A. A new normal form theorem for context-free phrase structure grammars. J. ACM, 12:42-52, Jan. 1965.
10. Griffiths, T. V. and Petrick, S. R. On the relative efficiencies of context-free grammar recognizers. Commun. ACM, 8(5):289-300, May 1965.
11. Commun. ACM, 8(10):594, Oct 1965.
12. Younger, Daniel H. Recognition and parsing of context-free languages in time n3. Inform. Control, 10(2):189-208, Feb. 1967.
13. Domolki, Balint. A universal compiler system based on production rules. BIT, 8(4):262- 275, Oct. 1968.
14. Unger, S. H. A global parser for context-free phrase structure grammars. Commun. ACM, 11(4):240-247, April 1968.
15. Commun. ACM, 11(6):427, June 1968.
16. Kasami, T. and Torii, K. A syntax-analysis procedure for unambiguous context-free grammars. J. ACM, 16(3):423-431, July 1969.
17. Earley, J. An efficient context-free parsing algorithm. Commun. ACM, 13(2):94-102, Feb. 1970.
18. Hext, J. B. and Roberts, P. S. Syntax analysis by Domolki's algorithm. Computer J., 13(3):263-271, Aug. 1970.
19. Kay, M. The MIND system. In R. Rustin, editor, Natural Language Processing, pages 155-188. Algorithmic Press, New York, 1973.
20. Bouckaert, M., Pirotte, A., and Snelling, M. Efficient parsing algorithms for general context-free parsers. Inform. Sci., 8(1):1-26, Jan. 1975.
21. Valiant, Leslie G. General context-free recognition in less than cubic time. J. Comput. Syst. Sci., 10:308-315, 1975.
22. Graham, Susan L. and Harrison, Michael A. Parsing of general context-free languages. In Advances in Computing, Vol. 14, pages 77-185, New York, 1976.
23. Sheil, B. Observations on context-free parsing. Statistical Methods in Linguistics, pages 71-109, 1976.
24. Deussen, P. A unified approach to the generation and acception of formal languages. Acta Inform., 9(4):377-390, 1978.
25. Deussen, Peter. One abstract accepting algorithm for all kinds of parsers. In Hermann A. Maurer, editor, Automata, Languages and Programming, volume 71 of Lecture Notes in Computer Science, pages 203-217. Springer-Verlag, Berlin, 1979.
26. Graham, S. L., Harrison, M. A., and Ruzzo, W. L. An improved context-free recognizer. ACM Trans. Prog. Lang. Syst., 2(3):415-462, July 1980.
27. Kilbury, James. Chart parsing and the Earley algorithm. In Ursula Klenk, editor, Kontextfreie Syntaxen und verwandte Systeme, volume 155 pages 76-89. Max Niemeyer Verlag, Tubingen, Oct. 1984.
28. Kay, Martin. Algorithm schemata and data structures in syntactic processing. In B.J. Grosz, K. Sparck Jones, and B.L. Webber, editors, Readings in Natural Language Processing, pages 35-70. Morgan Kaufmann, 1986.
29. Cohen, Jacques and Hickey, Timothy J. Parsing and compiling using Prolog. ACM Trans. Prog. Lang. Syst., 9(2):125-164, April 1987.
30. Wiren, Mats. A comparison of rule-invocation strategies in context-free chart parsing. In Third Conference of the European Chapter of the Association for Computational Linguistics, pages 226-233, April 1987.
31. Rus, Teodor. Parsing languages by pattern matching. IEEE Trans. Softw. Eng., 14(4):498-511, April 1988.
32. Kruseman Aretz, F. E. J. A new approach to Earley's parsing algorithm. Sci. Comput. Progr., 12(2):105-121, July 1989.
33. Voisin, Frederic and Raoult, Jean-Claude. A new, bottom-up, general parsing algorithm. BIGRE Bulletin, 70:221-235, Sept. 1990.
34. Lang, Bernard. Towards a uniform formal framework for parsing. In Masaru Tomita, editor, Current Issues in Parsing Technology, pages 153-171. Kluwer Academic Publ., Boston, 1991.
35. Leo, Joop M. I. M. A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead. Theoret. Comput. Sci., 82:165-176, 1991.
36. Nederhof, M.-J. An optimal tabular parsing algorithm. In 32nd Annual Meeting of the Association for Computational Linguistics, pages 117-124, June 1994.
37. Rytter, W. Context-free recognition via shortest-path computation: A version of Valiant's algorithm. Theoret. Comput. Sci., 143(2):343-352, 1995.
38. McLean, Philippe and Horspool, R. Nigel. A faster Earley parser. In Tibor Gyimothy, editor, Compiler Construction: 6th International Conference, CC'96, volume 1060 of Lecture Notes in Computer Science, pages 281-293, New York, 1996. Springer-Verlag.
39. Johnstone, Adrian and Scott, Elizabeth. Generalized recursive-descent parsing and follow-determinism. In Kai Koskimies, editor, Compiler Construction (CC'98), volume 1383 of Lecture Notes in Computer Science, pages 16-30, Lisbon, 1998. Springer.
40. Aycock, John and Horspool, R. Nigel. Directly-executable Earley parsing. In Compiler Construction, volume 2027 of Lecture Notes in Computer Science, pages 229-243, 2001.
41. Aycock, John and Horspool, R. Nigel. Practical Earley parsing. Computer J., 45(6):620- 630, 2002.
42. Lee, Lillian. Fast context-free grammar parsing requires fast Boolean matrix multiplication. J. ACM, 49(1):1-15, 2002.
43. Nederhof, Mark-Jan and Satta, Giorgio. Tabular parsing Formal Languages and Applications, Studies in Fuzziness and Soft Computing, pages 529-549. Springer, April 2004.
44. Lucas, P. Die Strukturanalyse von Formelnubersetzern/Analysis of the structure of formula translators. Elektronische Rechenanlagen, 3(11):159-167, 1961.
45. Kurki-Suonio, R. Notes on top-down languages. BIT, 9:225-238, 1969.
46. Knuth, Donald E. Top-down syntax analysis. Acta Inform., 1:79-110, 1971.
47. Jarzabek, S. and Krawczyk, T. LL-regular grammars. Inform. Process. Lett., 4(2):31- 37, 1975.
48. Nijholt, A. On the parsing of LL-regular grammars. In A. Mazurkiewicz, editor, Mathematical Foundations of Computer Science, volume 45 of Lecture Notes in Computer Science, pages 446-452. Springer-Verlag, Berlin, 1976.
49. Lewi, J., Vlaminck, K., de Huens, J., and Huybrechts, M. The ELL(1) parser generator and the error-recovery mechanism. Acta Inform., 10:209-228, 1978.
50. Poplawski, D. A. On LL-regular grammars. J. Comput. Syst. Sci., 18:218-227, 1979.
51. Nijholt, A. LL-regular grammars. Intern. J. Comput. Math., A8:303-318, 1980.
52. Heckmann, Reinhold. An efficient ELL(1)-parser generator. Acta Inform., 23:127- 148, 1986.
53. Barnard, David T. and Cordy, James R. Automatically generating SL parsers from LL(1) grammars. Comput. Lang., 14(2):93-98, 1989.
54. Parr, Terence J. and Quong, Russell W. LL and LR translators need k1 lookahead. ACM SIGPLAN Notices, 31(2):27-34, Feb. 1996.
55. Knuth, D. E. On the translation of languages from left to right. Inform. Control, 8:607- 639, 1965.
56. Korenjak, A. J. A practical method for constructing LR(k) processors. Commun. ACM, 12(11):613-623, Nov. 1969.
57. De Remer, Franklin L. Simple LR(k) grammars. Commun. ACM, 14(7):453-460, July 1971.
58. Anderson, T. Syntactic Analysis of LR(k) Languages. PhD thesis, Technical report, University of Newcastle upon Tyne, Newcastle upon Tyne, 1972.
59. Anderson, T., Eve, J., and Horning, J. J. Efficient LR(1) parsers. Acta Inform., 2:12-39, 1973.
60. Culik II, Karel and Cohen, Rina. LR-regular grammars: An extension of LR(k) grammars. J. Comput. Syst. Sci., 7:66-96, 1973.
61. La Londe, Wilf R. Regular right part grammars and their parsers. Commun. ACM, 20(10):731-741, Oct. 1977.
62. LaLonde, W. R. Constructing LR parsers for regular right part grammars. Acta Inform., 11:177-193, 1979.
63. Baker, Theodore P. Extending look-ahead for LR parsers. J. Comput. Syst. Sci., 22(2):243-259, 1981.
64. Kristensen, Bent Bruun and Madsen, Ole Lehrmann. Methods for computing LALR(k) lookahead. ACM Trans. Prog. Lang. Syst., 3(1):60-82, Jan. 1981.
65. La Londe, Wilf R. The construction of stack-controlling LR parsers for regular right part grammars. ACM Trans. Prog. Lang. Syst., 3(2):168-206, April 1981.
66. De Remer, Frank L. and Pennello, Thomas J. Efficient computation of LALR(1) lookahead sets. ACM Trans. Prog. Lang. Syst., 4(4):615-649, Oct. 1982.
67. Heilbrunner, S. Truly prefix-correct chain-free LR(1) parsers. Acta Inform., 22(5):499- 536, 1985.
68. Park, Joseph C. H., Choe, K.-M., and Chang, C.-H. A new analysis of LALR formalisms. ACM Trans. Prog. Lang. Syst., 7(1):159-175, Jan. 1985.
69. Ukkonen, Esko. Upper bounds on the size of LR(k) parsers. Inform. Process. Lett., 20(2):99-105, Feb. 1985.
70. Al-Hussaini, A. M. M. and Stone, R. G. Yet another storage technique for LR parsing tables. Softw. Pract. Exper., 16(4):389-401, 1986.
71. Ives, Fred. Unifying view of recent LALR(1) lookahead set algorithms. ACM SIGPLAN Notices, 21(7):131-135, July 1986.
72. Nakata, Ikuo and Sassa, Masataka. Generation of efficient LALR parsers for regular right part grammars. Acta Inform., 23:149-162, 1986.
73. Pennello, Thomas J. Very fast LR parsing. ACM SIGPLAN Notices, 21(7):145-151, July 1986.
74. Chapman, Nigel P. LR Parsing: Theory and Practice. Cambridge University Press, New York, NY, 1987.
75. Ives, Fred. Response to remarks on recent algorithms for LALR lookahead sets. ACM SIGPLAN Notices, 22(8):99-104, Aug. 1987.
76. Park, Joseph C. H. and Choe, Kwang-Moo. Remarks on recent algorithms for LALR lookahead sets. ACM SIGPLAN Notices, 22(4):30-32, April 1987.
77. Sassa, Masataka and Nakata, Ikuo. A simple realization of LR-parsers for regular right part grammars. Inform. Process. Lett., 24(2):113-120, Jan. 1987.
78. Bermudez, Manuel E. and Schimpf, Karl M. On the (non-)relationship between SLR(1) and NQLALR(1) grammars. ACM Trans. Prog. Lang. Syst., 10(2):338-342, April 1988.
79. Bermudez, Manuel E. and Schimpf, Karl M. A general model for fixed look-ahead LR parsers. Intern. J. Comput. Math., 24(3-4):237-271, 1988.
80. Kruseman Aretz, F. E. J. On a recursive ascent parser. Inform. Process. Lett., 29(4):201-206, Nov. 1988.
81. Roberts, George H. Recursive ascent: An LR analog to recursive descent. ACM SIGPLAN Notices, 23(8):23-29, Aug. 1988.
82. Bermudez, Manuel E. and Logothetis, George. Simple computation of LALR(1) lookahead sets. Inform. Process. Lett., 31(5):233-238, 1989.
83. Horspool, R. Nigel. ILALR: An incremental generator of LALR(1) parsers. In D. Hammer, editor, Compiler Compilers and High-Speed Compilation, volume 371 of Lecture Notes in Computer Science, pages 128-136. Springer-Verlag, Berlin, 1989.
84. Roberts, George H. Another note on recursive ascent. Inform. Process. Lett., 32(5):263- 266, 1989.
85. Bermudez, Manuel E. and Schimpf, Karl M. Practical arbitrary lookahead LR parsing. J. Comput. Syst. Sci., 41(2):230-250, Oct. 1990.
86. Heering, J., Klint, P., and Rekers, J. Incremental generation of parsers. IEEE Trans. Softw. Eng., 16(12):1344-1351, 1990.
87. Horspool, R. N. Incremental generation of LR parsers. Comput. Lang., 15(4):205- 233, 1990.
88. Horspool, R. Nigel and Whitney, Michael. Even faster LR parsing. Softw. Pract. Exper., 20(6):515-535, June 1990.
89. McKenzie, B. J. LR parsing of CFGs with restrictions. Softw. Pract. Exper., 20(8):823- 832, Aug. 1990.
90. Roberts, George H. From recursive ascent to recursive descent: via compiler optimizations. ACM SIGPLAN Notices, 25(4):83-89, April 1990.
91. Charles, Phillippe. A Practical Method for Constructing Efficient LALR(k) Parsers with Automatic Error Recovery. PhD thesis, Technical report, NYU, Feb. 1991.
92. Fortes Galvez, Jose. Generating LR(1) parsers of small size. In U. Kastens and P. Pfahler, editors, Compiler Construction, 4th International Conference, CC'92, volume 641 of Lecture Notes in Computer Science, pages 16-29. Springer-Verlag, Oct. 1992.
93. Shin, Heung-Chul and Choe, Kwang-Moo. An improved LALR(k) parser generation for regular right part grammars. Inform. Process. Lett., 47(3):123-129, 1993.
94. Fortes Galvez, Jose. A note on a proposed LALR parser for extended context-free grammars. Inform. Process. Lett., 50(6):303-305, June 1994.
95. Fortes Galvez, Jose. A practical small LR parser with action decision through minimal stack suffix scanning. In Developments in Language Theory, pages 460-465, Singapore, 1995.
96. Seyfarth, Benjamin R. and Bermudez, Manuel E. Suffix languages in LR parsing. Intern. J. Comput. Math., A-55(3-4):135-154, 1995.
97. Nederhof, Mark-Jan and Sarbo, Janos J. Increasing the applicability of LR parsing. In Harry Bunt and Masaru Tomita, editors, Recent Advances in Parsing Technology, pages 35-58. Kluwer Academic Publishers, Dordrecht, 1996.
98. Fortes Galvez, Jose. A Discriminating-Reverse Approach To LR(k) Parsing. PhDthesis, Technical report, Univesite de Nice-Sophia Antipolis, Nice, France, 1998.
99. Bertsch, Eberhard and Nederhof, Mark-Jan. Regular closure of deterministic languages. SIAM J. Computing, 29(1):81-102, 1999.
100. Morimoto, Shin-Ichi and Sassa, Masataka. Yet another generation of LALR parsers for regular right part grammars. Acta Inform., 37(9):671-697, 2000.
101. Farre, Jacques and Fortes Galvez, Jose. A bounded graph-connect construction for LRregular parsers. In Compiler Construction: 10th International Conference, CC 2001, volume 2027 of Lecture Notes in Computer Science, pages 244-258. Springer-Verlag, 2001.
102. Kannapinn, Sonke. Eine Rekonstruktion der LR-Theorie zur Elimination von Redundanzen mit Anwendung auf den Bau von ELR-Parsern. PhD thesis, Technical report, Technische Universitat Berlin, Berlin, July 2001, (in German).
103. Scott, Elizabeth and Johnstone, Adrian. Reducing non-determinism in reductionmodified LR(1) parsers. Technical Report CSD-TR-02-04, Royal Holloway, University of London, Jan. 2002.
104. Rosenkrantz, D. J. and Lewis II, P. M. Deterministic left-corner parsing. In IEEE Conference Record 11th Annual Symposium on Switching and Automata Theory, volume 11, pages 139-152, 1970.
105. Lomet, David B. Automatic generation of multiple exit parsing subroutines. In J. Loeckx, editor, Automata, Languages and Programming, volume 14 of Lecture Notes in Computer Science, pages 214-231. Springer-Verlag, Berlin, 1974.
106. Demers, Alan J. Generalized left corner parsing. In Fourth ACM Symposium on Principles of Programming Languages, pages 170-182, New York, 1977.
107. Soisalon-Soininen, Eljas and Ukkonen, Esko. A method for transforming grammars into LL(k) form. Acta Inform., 12:339-369, 1979.
108. th International Symposium on Programming Language Implementation and Logic Programming, volume 714 of Lecture Notes in Computer Science, pages 108-122. Springer-Verlag, Aug. 1993.
109. Žemlicka, Michal and Kral, Jaroslav. Run-time extensible deterministic top-down parsing. Grammars, 2(3):283-293, 1999.
110. Žemlicka, Michal. Parsing with oracle. In Text, Speech and Dialogue, volume 4188 of Lecture Notes in Computer Science, pages 309-316. Springer, 2006.
111. Žemlicka, Michal. Principles of Kind Parsing. PhD thesis, Technical report, Charles University, Prague, June 2006.
112. Adams, Eldridge S. and Schlesinger, Stewart I. Simple automatic coding systems. Commun. ACM, 1(7):5-9, July 1958.
113. Wolpe, Harold. Algorithm for analyzing logical statements to produce a truth function table. Commun. ACM, 1(3):4-13, March 1958.
114. Sheridan, P. B. The arithmetic translator-compiler of the IBM FORTRAN automatic coding system. Commun. ACM, 2:9-21, Feb. 1959.
115. Samelson, K. and Bauer, F. L. Sequential formula translation. Commun. ACM, 3(2):76- 83, Feb. 1960.
116. Floyd, Robert W. A descriptive language for symbol manipulation. J. ACM, 8:579-584, Oct. 1961.
117. Paul, M. A general processor for certain formal languages. In Symposium on Symbolic Languages in Data Processing, pages 65-74, New York, 1962.
118. Eickel, J., Paul, M., Bauer, F. L., and Samelson, K. A syntax-controlled generator of formal language processors. Commun. ACM, 6(8):451-455, Aug. 1963.
119. Floyd, Robert W. Syntactic analysis and operator precedence. J. ACM, 10(3):316-333, July 1963.
120. Floyd, Robert W. Bounded context syntax analysis. Commun. ACM, 7(2):62-67, Feb. 1964.
121. Wirth, Niklaus and Weber, Helmut. EULER: A generalization of ALGOL and its formal definition, Part 1/2. Commun. ACM, 9(1/2):13-99, Jan. 1966.
122. Colmerauer, A. Précedence, analyse syntactique et languages de programmation. PhD thesis, Technical report, Universite de Grenoble, Grenoble, 1967, (in French).
123. Bell, James R. A new method for determining linear precedence functions for precedence grammars. Commun. ACM, 12(10):567-569, Oct. 1969.
124. Ichbiah, J. and Morse, S. A technique for generating almost optimal Floyd-Evans productions of precedence grammars. Commun. ACM, 13(8):501-508, Aug. 1970.
125. Loeckx, Jacques. An algorithm for the construction of bounded-context parsers. Commun. ACM, 13(5):297-307, May 1970.
126. McKeeman, William M., Horning, James J., and Wortman, David B. A Compiler Generator. Prentice Hall, Englewood Cliffs, N.J., 1970.
127. Gray, James N. and Harrison, Michael A. Canonical precedence schemes. J. ACM, 20(2):214-234, April 1973.
128. Levy, M. R. Complete operator precedence. Inform. Process. Lett., 4(2):38-40, Nov. 1975.
129. Henderson, D. S. and Levy, M. R. An extended operator precedence parsing algorithm. Computer J., 19(3):229-233, 1976.
130. Bertsch, Eberhard. The storage requirement in precedence parsing. Commun. ACM, 20(3):192-194, March 1977.
131. Williams, M. H. Complete operator precedence conditions. Inform. Process. Lett., 6(2):60-62, April 1977.
132. Williams, M. H. Conditions for extended operator precedence parsing. Computer J., 22(2):164-168, 1979.
133. Gonser, Peter. Behandlung syntaktischer Fehler unter Verwendung kurzer, fehlereinschließender Intervalle. PhD thesis, Technical report, Technische Universitat Munchen, Munchen, July 21 1981, (in German).
134. Williams, M. H. A systematic test for extended operator precedence. Inform. Process. Lett., 13(4-5):187-190, 1981.
135. Peyton Jones, Simon L. Parsing distfix operators. Commun. ACM, 29(2):118-122, Feb. 1986.
136. Aasa, Annika. Precedences in specifications and implementations of programming languages. Theoret. Comput. Sci., 142(1):3-26, May 1995.
137. Mealy, George H. A method for synthesizing sequential circuits. Bell System Technical J., 34(5):1045-1079, 1955.
138. Kleene, S. C. Representation of events in nerve nets and finite automata. In C. E. Shannon and J. McCarthy, editors, Automata Studies, pages 3-42. Princeton University Press, Princeton, N.J., 1956.
139. Moore, E. F. Gedanken-experiments on sequential machines. Annals of Mathematics Studies, pages 129-153. Princeton University Press, Princeton, NJ, 1956.
140. McNaughton, R. and Yamada, H. Regular expressions and state graphs for automata. IRE Transactions Computers, EC-9(1):39-47, March 1960.
141. Brzozowski, J. A. Canonical regular expressions and minimal state graphs for definite events. In Symp. on Math. Theory of Automata, pages 529-561, Brooklyn. N.Y., 1963.
142. Brzozowski, Janusz A. Derivatives of regular expressions. J. ACM, 11(4):481-494, 1964.
143. Thompson, Ken. Regular expression search algorithm. Commun. ACM, 11(6):419-422, June 1968.
144. Aho, Alfred V. and Corasick, Margaret J. Efficient string matching: An aid to bibliographic search. Commun. ACM, 18(6):333-340, June 1975.
145. Krzemien, Roman and Łukasiewicz, Andrzej. Automatic generation of lexical analyzers in a compiler-compiler. Inform. Process. Lett., 4(6):165-168, March 1976.
146. Boyer, Robert S. and Moore, J. Strother. A fast string searching algorithm. Commun. ACM, 20(10):762-772, 1977.
147. Ostrand, Thomas J., Paull, Marvin C., and Weyuker, Elaine J. Parsing regular grammars with finite lookahead. Acta Inform., 16:125-138, 1981.
148. Karp, Richard M. and Rabin, Michael O. Efficient randomized pattern-matching algorithms. IBM J. Research and Development, 31(2):249-260, 1987.
149. Jones, Douglas W. How (not) to code a finite-state machine. ACM SIGPLAN Notices, 23(8):19-22, Aug. 1988.
150. Aho, A. V. Algorithms for finding patterns in strings. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science - Algorithms and Complexity, Vol. A, pages 255-300. Elsevier, Amsterdam, The Netherlands, 1990. Chapter 5.
151. Roche, Emmanuel. Factorization of finite-state transducers. Technical Report TR- 95-2, Mitsubishi Electric Research Laboratories, Cambridge, MA., Feb. 1995.
152. Watson, Bruce W. A new regular grammar pattern matching algorithm. In Josep Diaz and Maria Serna, editors, Algorithms: ESA '96, Fourth Annual European Symposium, volume 1136 of Lecture Notes in Computer Science, pages 364-377, Barcelona, Spain, Sept. 1996. Springer.
153. Bruggemann-Klein, Anne and Wood, Derick. The validation of SGML content models. Math. Comp. Modelling, 25(4):73-84, 1997.
154. Aho, Alfred V. and Ullman, Jeffrey D. The Theory of Parsing, Translation and Compiling: Volume I: Parsing. Prentice Hall, Englewood Cliffs, N.J., 1972.
155. Backhouse, Roland C. Syntax of Programming Languages. Prentice Hall, London, 1979.
156. Nijholt, Anton. Parsing strategies: A concise survey. In J. Gruska and M. Chytil, editors, Mathematical Foundations of Computer Science, volume 118 of Lecture Notes in Computer Science, pages 103-120. Springer-Verlag, Berlin, 1981.
157. Leermakers, R. The Functional Treatment of Parsing. Kluwer Academic Publishers, 1993.
158. Nederhof, M.-J. Linguistic Parsing and Program Transformation. PhD thesis, Technical report, Katholieke Universiteit Nijmegen, Nijmegen, 1994.
159. Schabes, Yves. The functional treatment of parsing: Book review. Computational Linguistics, 21(1):112-115, 1995.
160. Sikkel, K. Parsing Schemata. Springer Verlag, 1996.
161. Lang, Bernard. Deterministic techniques for efficient non-deterministic parsers. In J. Loeckx, editor, Automata, Languages and Programming, volume 14 of Lecture Notes in Computer Science, pages 255-269. Springer-Verlag, Berlin, 1974.
162. Tomita, Masaru. LR parsers for natural languages. In 10th International Conference on Computational Linguistics, pages 354-357. ACL, 1984.
163. Tomita, Masaru. An efficient context-free parsing algorithm for natural languages. In International Joint Conference on Artificial Intelligence, pages 756-764, 1985.
164. Tomita, Masaru. Efficient Parsing for Natural Language. Kluwer Academic Publishers, Boston, 1986.
165. Banko, Mirosław. Efficient parsing for natural language: Book review. Computational Linguistics, 14(2):80-81, 1988.
166. Billot, Sylvie and Lang, Bernard. The structure of shared forests in ambiguous parsing. In 27th Annual Meeting of the Association for Computational Linguistics, pages 143- 151, June 1989.
167. Kipps, James R. GLR parsing in time O(n3). In M. Tomita, editor, Generalized LR Parsing, pages 43-59. Kluwer Academic Publishers, Boston, 1991.
168. Lankhorst, Marc. An empirical comparison of generalized LR tables. In R. Heemels, A. Nijholt, and K. Sikkel, editors, Tomita's Algorithm: Extensions and Applications (TWLT1), Memoranda Informatica in TwenteWorkshops on Language Technology, pages 87-93, Enschede, the Netherlands, 1991.
169. Nozohoor-Farshi, R. GLR parsing for grammars. In M. Tomita, editor, Generalized LR Parsing, pages 61-75. Kluwer Academic Publishers, Boston, 1991.
170. Piastra, Marco and Bolognesi, Roberto. An efficient context-free parsing algorithm with semantic actions. In Trends in Artificial Intelligence, volume 549 of Lecture Notes in Artificial Intelligence, pages 271-280. Springer-Verlag, Oct. 1991.
171. Rekers, J. Generalized LR parsing for general context-free grammars. Technical Report CS-R9153, CWI, Amsterdam, 1991.
172. Deudekom, A. van and Kooiman, P. Top-down non-correcting error recovery in LLgen. Technical Report IR 338, Vrije Universiteit, FaculteitWiskunde en Informatica, Amsterdam, Oct. 1993.
173. Merrill, G. H. Parsing non-LR(k) grammars with yacc. Softw. Pract. Exper., 23(8):829- 850, 1993.
174. Nederhof, Mark-Jan. Generalized left-corner parsing. In Sixth Conference of the European Chapter of the Association for Computational Linguistics, pages 305-314, April 1993.
175. Lavie, Aaron and Tomita, Masaru. GLR: An efficient noise-skipping parsing algorithm for context-free grammars. In Harry Bunt and Masaru Tomita, editors, Recent Advances in Parsing Technology, pages 183-200. Kluwer Academic Publishers, Dordrecht, 1996.
176. Nederhof, M.-J. and Satta, G. Efficient tabular LR parsing. In 34th Annual Meeting of the Association for Computational Linguistics, pages 239-246. Association for Computational Linguistics, 1996.
177. Alonso Pardo, M. A., Cabrero Souto, D., and Vilares Ferro, M. Construction of efficient generalized LR parsers. In Derick Wood and Sheng Yu, editors, Second InternationalWorkshop on Implementing Automata, volume 1436 of Lecture Notes in Computer Science, pages 7-24, Berlin, 1998.
178. Aycock, John and Horspool, R. Nigel. Faster generalized LR parsing. In Compiler Construction: 8th International Conference, CC'99, volume 1575 of Lecture Notes in Computer Science, pages 32-46, Berlin, 1999. Springer Verlag.
179. Scott, Elizabeth, Johnstone, Adrian, and Hussain, Shamsa Sadaf. Tomita-style generalised LR parsers. Technical report, Royal Holloway, University of London, London, Dec. 2000.
180. Aycock, John, Horspool, R. Nigel, Janoušek, Jan, and Melichar, Borivoj. Even faster generalized LR parsing. Acta Inform., 37(9):633-651, 2001.
181. Fortes Galvez, Jose, Farre, Jacques, and Aguiar, Miguel Angel Perez. Practical nondeterministic DR(k) parsing on graph-structured stack. In Computational Linguistics and Intelligent Text Processing, volume 2004 of Lecture Notes in Computer Science, pages 411-422. Springer Verlag, 2001.
182. th Hawaii International Conference on System Sciences, page 282. IEEE, 2002.
183. Johnstone, Adrian and Scott, Elizabeth. Generalised regular parsers. In Compiler Construction: 12th International Conference, CC'03, volume 2622 of Lecture Notes in Computer Science, pages 232-246. Springer Verlag, 2003.
184. Scott, E., Johnstone, A., and Economopoulos, G. R. BRN-table based GLR parsers. Technical Report CSD-TR-03-06, CS Dept., Royal Holloway, University of London, London, July 2003.
185. Scott, Elizabeth and Johnstone, Adrian. Table based parsers with reduced stack activity. Technical Report CSD-TR-02-08, CS Dept., Royal Holloway, University of London, London, May 2003.
186. Johnstone, Adrian, Scott, Elizabeth, and Economopoulos, Giorgios R. Generalised parsing: Some costs. In Compiler Construction: 13th International Conf. CC'2004, volume 2985 of Lecture Notes in Computer Science, pages 89-103, Berlin, 2004. Springer-Verlag.
187. Johnstone, Adrian and Scott, Elizabeth. Recursion engineering for reduction incorporated parsers. Electr. Notes Theor. Comput. Sci., 141(4):143-160, 2005.
188. Scott, Elizabeth and Johnstone, Adrian. Generalised bottom up parsers with reduced stack activity. Computer J., 48(5):565-587, 2005.
189. Johnstone, Adrian, Scott, Elizabeth, and Economopoulos, Giorgios R. Evaluating GLR parsing algorithms. Sci. Comput. Progr., 61(3):228-244, 2006.
190. Scott, Elizabeth and Johnstone, Adrian. Right nulled GLR parsers. ACM Trans. Prog. Lang. Syst., 28(4):577-618, 2006.
191. Floyd, Robert W. Bounded context syntax analysis. Commun. ACM, 7(2):62-67, Feb. 1964.
192. Colmerauer, Alain. Précedence, analyse syntactique et languages de programmation. PhD thesis, Technical report, Universite de Grenoble, Grenoble, 1967, (in French).
193. Colmerauer, Alain. Total precedence relations. J. ACM, 17(1):14-30, Jan. 1970.
194. Szymanski, T. G. Generalized Bottom-up Parsing. PhD thesis, Technical Report TR73- 168, Cornell University, Ithaca, N.Y., 1973.
195. Williams, John H. Bounded-context parsable grammars. Inform. Control, 28(4):314- 334, Aug. 1975.
196. Szymanski, Thomas G. and Williams, John H. Non-canonical extensions of bottomup parsing techniques. SIAM J. Computing, 5(2):231-250, June 1976.
197. Friede, Dietmar. Transition diagrams and strict deterministic grammars. In Klaus Weihrauch, editor, 4th GI-Conference, volume 67 of Lecture Notes in Computer Science, pages 113-123, Berlin, 1978. Springer-Verlag.
198. Friede, Dietmar. Partitioned LL(k) grammars. In H.A. Maurer, editor, Automata, Languages and Programming, volume 71 of Lecture Notes in Computer Science, pages 245- 255. Springer-Verlag, Berlin, 1979.
199. Tai, Kuo-Chung. Noncanonical SLR(1) grammars. ACM Trans. Prog. Lang. Syst., 1(2):295-320, Oct. 1979.
200. Proudian, Derek and Pollard, Carl J. Parsing head-driven phrase structure grammar. In 23rd Annual Meeting of the Association for Computational Linguistics, pages 167-171, 1985.
201. Kay, Martin. Head-driven parsing. In International Workshop on Parsing Technologies, pages 52-62, 1989.
202. Salomon, Daniel J. and Cormack, Gordon V. Scannerless NSLR(1) parsing of programming languages. ACM SIGPLAN Notices, 24(7):170-178, July 1989.
203. Satta, Giorgio and Stock, Oliviero. Head-driven bidirectional parsing: A tabular method. In International Workshop on Parsing Technologies, pages 43-51, 1989.
204. Hutton, Michael D. Noncanonical extensions of LR parsing methods. Technical report, University of Waterloo, Aug. 1990.
205. Nederhof, M.-J. and Satta, G. An extended theory of head-driven parsing. In 32nd Annual Meeting of the Association for Computational Linguistics, pages 210-217, June 1994.
206. Sikkel, K. and Akker, R. Opden. Predictive head-corner chart parsing. In Harry Bunt and Masaru Tomita, editors, Recent Advances in Parsing Technology, pages 113-132. Kluwer Academic Publishers, Dordrecht, 1996.
207. Noord, Gertjan. An efficient implementation of the head-corner parser. Computational Linguistics, 23(3):425-456, 1997.
208. Madhavan, Maya, Shankar, Priti, Rai, Siddharta, and Ramakrishna, U. Extending Graham-Glanville techniques for optimal code generation. ACM Trans. Prog. Lang. Syst., 22(6):973-1001, Nov. 2000.
209. th Internat. Conf. Implementation and Applications of Automata, CIAA 2000, volume 2088 of Lecture Notes in Computer Science, pages 122-134, 2001.
210. Farre, Jacques and Fortes Galvez, Jose. Bounded-graph construction for noncanonical discriminating-reverse parsers. In 6th Internat. Conf. Implementation and Applications of Automata, CIAA 2001, volume 2494 of Lecture Notes in Computer Science, pages 101-114. Springer Verlag, 2002.
211. Farre, Jacques and Fortes Galvez, J. Bounded-connect noncanonical discriminatingreverse parsers. Theoret. Comput. Sci., 313(1):73-91, 2004.
212. Lang, Bernard. Parsing incomplete sentences. In D. Vargha, editor, 12th International Conf. on Comput. Linguistics COLING'88, pages 365-371.
213. Cormack, Gordon V. An LR substring parser for noncorrecting syntax error recovery. ACM SIGPLAN Notices, 24(7):161-169, July 1989.
214. Rekers, Jan and Koorn, Wilco. Substring parsing for arbitrary context-free grammars. ACM SIGPLAN Notices, 26(5):59-66, May 1991.
215. Rekers, J. Parser Generation for Interactive Environments. PhD thesis, Technical report, Leiden University, Leiden, 1992.
216. Bates, Joseph and Lavie, Alon. Recognizing substrings of LR(k) languages in linear time. ACM Trans. Prog. Lang. Syst., 16(3):1051-1077, 1994.
217. Bertsch, Eberhard. An asymptotically optimal algorithm for non-correcting LL(1) error recovery. Technical Report 176, Ruhr-Universitat Bochum, Bochun, Germany, April 1994.
218. Nederhof, Mark-Jan and Bertsch, Eberhard. Linear-time suffix parsing for deterministic languages. J. ACM, 43(3):524-554, May 1996.
219. Ruckert, Martin. Generating efficient substring parsers for BRC grammars. Technical Report 98-105, State University of New York at New Paltz, New Paltz, NY 12561, July 1998.
220. Goeman, Heiko. On parsing and condensing substrings of LR languages in linear time. Theoret. Comput. Sci., 267(1-2):61-82, 2001.
221. Bar-Hillel, Y., Perles, M., and Shamir, E. On formal properties of simple phrase structure grammars. Zeitschrift für Phonetik, Sprachwissenschaft und Kommunikationsforschung, 14:143-172, 1961.
222. Lang, Bernard. A generative view of ill-formed input processing. In ATR Symposium on Basic Research for Telephone Interpretation, Dec. 1989.
223. Noord, Gertjan. The intersection of Finite State Automata and Definite Clause Grammars. In 33rd Annual Meeting of the Association for Computational Linguistics, pages 159-165, June 1995.
224. Albro, Daniel M. Taking primitive optimality theory beyond the finite state. Technical report, Linguistics Department UCLA, 2000.
225. Fischer, Charles N. On parsing context-free languages in parallel environments. Technical Report 75-237, Cornell University, Ithaca, New York, April 1975.
226. Brent, R. P. and Goldschlager, L. M. A parallel algorithm for context-free parsing. Australian Comput. Sci. Commun., 6(7):71-710, 1984.
227. Bar-On, Ilan and Vishkin, Uzi. Optimal parallel generation of a computation tree form. ACM Trans. Prog. Lang. Syst., 7(2):348-357, April 1985.
228. Rytter, Wojciech. On the recognition of context-free languages. In Andrzej Skowron, editor, Computation Theory, volume 208 of Lecture Notes in Computer Science, pages 318-325. Springer Verlag, Berlin, 1985.
229. Rytter, Wojciech. Parallel time O(logn) recognition of unambiguous CFLs. In Fundamentals of Computation Theory, volume 199 of Lecture Notes in Computer Science, pages 380-389. Springer Verlag, Berlin, 1985.
230. Chang, J. H., Ibarra, O. H., and Palis, M. A. Parallel parsing on a one-way array of finite-state machines. IEEE Trans. Comput., 36:64-75, 1987.
231. Yonezawa, Akinori and Ohsawa, Ichiro. Object-oriented parallel parsing for contextfree grammars. In COLING-88: 12th International Conference on Computational Linguistics, pages 773-778, Aug. 1988.
232. Srikant, Y. N. Parallel parsing of arithmetic expressions. IEEE Trans. Comput., 39(1):130-132, 1990.
233. Alblas, Henk, Nijholt, Anton, Akker, Rieks opden, Oude Luttighuis, Paul, and Sikkel, Klaas. An annotated bibliography on parallel parsing. Technical Report INF 92-84, University of Twente, Enschede, The Netherlands, Dec. 1992.
234. Janssen, W., Poel, M., Sikkel, K., and Zwiers, J. The primordial soup algorithm: A systematic approach to the specification of parallel parsers. In Fifteenth International Conference on Computational Linguistics, pages 373-379, Aug. 1992.
235. Sikkel, Klaas and Lankhorst, Marc. A parallel bottom-up Tomita parser. In Gunther Gorz, editor, Konferenz Verarbeitung Natürlicher Sprache - KONVENS'92, Informatik Aktuell, pages 238-247. Springer-Verlag, Oct. 1992.
236. Alblas, Henk, Akker, Rieks opden, Oude Luttighuis, Paul, and Sikkel, Klaas. A bibliography on parallel parsing. ACM SIGPLAN Notices, 29(1):54-65, 1994..
237. Hendrickson, Kenneth J. A new parallel LR parsing algorithm. In ACM Symposium on Applied Computing, pages 277-281. ACM, 1995.
238. Ra, Dong-Yul and Kim, Jong-Hyun. A parallel parsing algorithm for arbitrary contextfree grammars. Inform. Process. Lett., 58(2):87-96, 1996.
239. Koster, Cornelis H. A. and Meertens, Lambert G. L. T. Basic English, a generative grammar for a part of English. Technical report, Euratom Seminar Machine en Talen of E.W. Beth, University of Amsterdam, 1962. 2.
240. McClure, R. M. TMG: A syntax-directed compiler. In 20th National Conference, pages 262-274. ACM, 1965.
241. Gilbert, Philip. On the syntax of algorithmic languages. J. ACM, 13(1):90-107, Jan. 1966.
242. Hotz, G. Erzeugung formaler Sprachen durch gekoppelte Ersetzungen. In F.L. Bauer and K. Samelson, editors, Kolloquium über Automatentheorie und formale Sprachen, pages 62-73. TU Munich, 1967.
243. Sintzoff, M. Existence of a van Wijngaarden syntax for every recursively enumerable set. Annales de la Société Scientifique de Bruxelles, 81(2):115-118, 1967.
244. Friš, Ivan. Grammars with partial ordering of the rules. Inform. Control, 12:415-425, 1968.
245. "Inform. Control", 15(5):452-453, Nov. 1969.
246. Knuth, Donald E. Semantics of context-free languages. Math. Syst. Theory, 2(2):127.
247. Math. Syst. Theory, 5, 1, 1971, pp. 95-96.
248. Wijngaarden, A. et al. Report on the algorithmic language ALGOL. Numer. Math., 14:79-218, 1969.
249. Koster, C. H. A. Affix grammars. In J.E.L. Peck, editor, ALGOL 68 Implementation, pages 95-109. North-Holland Publ. Co., Amsterdam, 1971.
250. Birman, Alexander and Ullman, Jeffrey D. Parsing algorithms with backtrack. Inform. Control, 23(1):1-34, 1973.
251. Lepisto, Timo. On ordered context-free grammars. Inform. Control, 22(1):56-68, Feb. 1973.
252. Schuler, P. F. Weakly context-sensitive languages as model for programming languages. Acta Inform., 3(2):155-170, 1974.
253. Wijngaarden, A. The generative power of two-level grammars. In J. Loeckx, editor, Automata, Languages and Programming, volume 14 of Lecture Notes in Computer Science, pages 9-16. Springer-Verlag, Berlin, 1974.
254. Joshi, Aravind K., Levy, Leon S., and Takahashi, Masako. Tree adjunct grammars. J. Comput. Syst. Sci., 10(1):136-163, 1975.
255. Wijngaarden, A. et al. Revised report on the algorithmic language ALGOL. Acta Inform., 5:1-236, 1975.
256. Cleaveland, J. Craig and Uzgalis, Robert C. Grammars for Programming Languages. Elsevier, New York, 1977.
257. Meersman, R. and Rozenberg, G. Two-level meta-controlled substitution grammars. Acta Inform., 10:323-339, 1978.
258. Dembinski, Piotr and Małuszynski, Jan. Two-level grammars: CF grammars with equation schemes. In Hermann A. Maurer, editor, Automata, Languages and Programming, volume 71 of Lecture Notes in Computer Science, pages 171-187. Springer-Verlag, Berlin, 1979.
259. Kastens, Uwe. Ordered attribute grammars. Acta Inform., 13(3):229-256, 1980.
260. Wegner, Lutz Michael. On parsing two-level grammars. Acta Inform., 14:175-193, 1980.
261. Wijngaarden, A. Languageless programming. In IFIP/TC2/WG2.1 Working Conference on the Relations Between Numerical Computation and Programming Languages, pages 361-371. North-Holland Publ. Comp., 1981.
262. Gerevich, Laszlo. A parsing method based on van Wijngaarden grammars. Computational Linguistics and Computer Languages, 15:133-156, 1982.
263. Watt, D. A. and Madsen, O. L. Extended attribute grammars. Computer J., 26(2):142- 149, 1983.
264. Grune, Dick. How to produce all sentences from a two-level grammar. Inform. Process. Lett., 19:181-185, Nov. 1984.
265. Małuszynski, J. Towards a programming language based on the notion of two-level grammar. Theoret. Comput. Sci., 28:13-43, 1984.
266. Edupuganty, Balanjaninath and Bryant, Barrett R. Two-level grammars for automatic interpretation. In 1985 ACM Annual Conference, pages 417-423. ACM, 1985.
267. Fisher, A. J. Practical LL(1)-based parsing of van Wijngaarden grammars. Acta Inform., 21:559-584, 1985.
268. Vijay-Shankar, K. and Joshi, Aravind K. Some computational properties of tree adjoining grammars. In 23rd Annual Meeting of the ACL, pages 82-93, University of Chicago, Chicago, IL, July 1985.
269. Barnard, D. T. and Cordy, J. R. SL parses the LR languages. Comput. Lang., 13(2):65- 74, July 1988.
270. Schabes, Yves and Vijay-Shankar, K. Deterministic left to right parsing of tree adjoining languages. In 28th Meeting of the Association for Computational Linguistics, pages 276-283. Association for Computational Linguistics, 1990.
271. Heilbrunner, S. and Schmitz, L. An efficient recognizer for the Boolean closure of context-free languages. Theoret. Comput. Sci., 80:53-75, 1991.
272. Koster, C. H. A. Affix grammars for natural languages. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 469-484, New York, 1991.
273. Koster, C. H. A. Affix grammars for programming languages. In Henk Alblas and Borivoj Melichar, editors, Attribute Grammars, Applications and Systems, volume 545 of Lecture Notes in Computer Science, pages 358-373. Springer-Verlag, New York, 1991.
274. Krulee, Gilbert K. Computer Processing of Natural Language. Prentice-Hall, 1991.
275. Schabes, Yves and Joshi, Aravind K. Parsing with lexicalized tree adjoining grammars. In Masaru Tomita, editor, Current Issues in Parsing Technology, pages 25-47. Kluwer Academic Publ., Boston, 1991.
276. Seki, Hiroyuki, Matsumura, Takashi, Fuji, Mamoru, and Kasami, Tadao. On multiple context-free grammars. Theoret. Comput. Sci., 88:191-229, 1991.
277. Fisher, Anthony J. A yo-yo parsing algorithm for a large class of van Wijngaarden grammars. Acta Inform., 29(5):461-481, 1992.
278. Grune, Dick. Two-level grammars are more expressive than Type grammars - or are they?. ACM SIGPLAN Notices, 28(8):43-45, Aug. 1993.
279. Pitsch, Gisela. LL(k) parsing of coupled context-free grammars. Computational Intelligence, 10(4):563-578, 1994.
280. Satta, Giorgio. Tree adjoining grammar parsing and boolean matrix multiplication. Computational Linguistics, 20(2):173-192, 1994.
281. Pitsch, Gisela. LR(k)-coupled-context-free grammars. Inform. Process. Lett., 55(6):349-358, Sept. 1995.
282. Hotz, Gunter and Pitsch, Gisela. On parsing coupled-context-free languages. Theoret. Comput. Sci., 161(1-2):205-233, 1996.
283. Kulkarni, Sulekha R. and Shankar, Priti. Linear time parsers for classes of non context free languages. Theoret. Comput. Sci., 165(2):355-390, 1996.
284. Rusmann, A. Dynamic LL(k) parsing. Acta Inform., 34(4):267-290, 1997.
285. Nederhof, Mark-Jan. An alternative LR algorithm for TAGs. In 36th Annual Meeting of the Association for Computational Linguistics, pages 946-952. ACL, 1998.
286. Prolo, Carlos A. An efficient LR parser generator for tree adjoining grammars. In 6th Int. Workshop on Parsing Technologies (IWPT 2000), pages 207-218, 2000.
287. Okhotin, Alexander. Conjunctive grammars. J. Automata, Languages and Combinatorics, 6(4):519-535, 2001.
288. Ford, Bryan. Packrat parsing: Simple, powerful, lazy, linear time. ACM SIGPLAN Notices, 37(9):36-47, Sept. 2002.
289. Jackson, Quinn Tyler. Efficient formalism-only parsing of XML/HTML using the §- calculus. ACM SIGPLAN Notices, 38(2):29-35, Feb. 2003.
290. Ford, Bryan. Parsing expression grammars: A recognition-based syntactic foundation. In 31st ACM SIGACT/SIGPLAN Symposium on Principles of Programming Languages, pages 111-122. ACM, Jan. 2004.
291. Grimm, Robert. Practical packrat parsing. Technical Report TR2004-854, Dept. of Computer Science, New York University, New York, March 2004.
292. Okhotin, Alexander. Boolean grammars. Information and Computation, 194(1):19- 48, 2004.
293. Okhotin, Alexander. On the existence of a Boolean grammar for a simple procedural language. In 11th International Conference on Automata and Formal Languages: AFL'05, 2005.
294. Jackson, Quinn Tyler. Adapting to Babel: Adaptivity and Context-Sensitivity in Parsing. In Press, 2006.
295. Aho, A. V. and Peterson, T. G. A minimum-distance error-correcting parser for contextfree languages. SIAM J. Computing, 1(4):305-312, 1972.
296. Conway, R. W. and Wilcox, T. R. Design and implementation of a diagnostic compiler for PL/I. Commun. ACM, 16(3):169-179, 1973.
297. Lyon, G. Syntax-directed least-errors analysis for context-free languages: A practical approach. Commun. ACM, 17(1):3-14, Jan. 1974.
298. Graham, Susan L. and Rhodes, Steven P. Practical syntactic error recovery. Commun. ACM, 18(11):639-650, Nov. 1975.
299. Horning, James J. What the compiler should tell the user. In Friedrich L. Bauer and Jurgen Eickel, editors, Compiler Construction, An Advanced Course, 2nd ed, volume 21 of Lecture Notes in Computer Science, pages 525-548. Springer, 1976.
300. Hartmann, Alfred C. A Concurrent Pascal Compiler for Minicomputers, volume 50 of Lecture Notes in Computer Science. Springer, 1977.
301. Lewi, J., Vlaminck, K., de Huens, J., and Huybrechts, M. The ELL(1) parser generator and the error-recovery mechanism. Acta Inform., 10:209-228, 1978.
302. Mickunas, M. Dennis and Modry, John A. Automatic error recovery for LR parsers. Commun. ACM, 21(6):459-465, June 1978.
303. Pennello, Thomas J. and De Remer, Frank L. A forward move algorithm for LR error recovery. In Fifth ACM Symposium on Principles of Programming Languages, pages 241-254, Jan. 1978.
304. Tanaka, Eiichi and Fu, King-Sun. Error-correcting parsers for formal languages. IEEE Trans. Comput., C-27(7):605-616, July 1978.
305. Fischer, C. N., Tai, K.-C., and Milton, D. R. Immediate error detection in strong LL(1) parsers. Inform. Process. Lett., 8(5):261-266, June 1979.
306. Fischer, C. N., Milton, D. R., and Quiring, S. B. Efficient LL(1) error correction and recovery using only insertions. Acta Inform., 13(2):141-154, 1980.
307. Pemberton, Steven. Comments on an error-recovery scheme by Hartmann. Softw. Pract. Exper., 10(3):231-240, 1980.
308. Rohrich, Johannes. Methods for the automatic construction of error correcting parsers. Acta Inform., 13(2):115-139, Feb. 1980.
309. Anderson, Stuart O. and Backhouse, Roland C. Locally least-cost error recovery in Earley's algorithm. ACM Trans. Prog. Lang. Syst., 3(3):318-347, July 1981.
310. Dwyer, Barry. A user-friendly algorithm. Commun. ACM, 24(9):556-561, Sept. 1981.
311. Gonser, Peter. Behandlung syntaktischer Fehler unter Verwendung kurzer, fehlereinschließender Intervalle. PhD thesis, Technical report, Technische Universitat Munchen, Munchen, July 21 1981, (in German).
312. Mauney, Jon and Fischer, Charles N. An improvement to immediate error detection in strong LL(1) parsers. Inform. Process. Lett., 12(5):211-212, 1981.
313. Anderson, S. O. and Backhouse, R. C. An alternative implementation of an insertiononly recovery technique. Acta Inform., 18:289-298, 1982.
314. Anderson, S. O., Backhouse, R. C., Bugge, E. H., and Stirling, C. P. An assessment of locally least-cost error recovery. Computer J., 26(1):15-24, 1983.
315. Brown, P. J. Error messages: The neglected area of the man/machine interface?. Commun. ACM, 26(4):246-249, 1983.
316. Richter, Helmut. Noncorrecting syntax error recovery. ACM Trans. Prog. Lang. Syst., 7(3):478-489, July 1985.
317. Stirling, Colin P. Follow set error recovery. Softw. Pract. Exper., 15(3):239-257, March 1985.
318. Choe, Kwang-Moo and Chang, Chun-Hyon. Efficient computation of the locally leastcost insertion string for the LR error repair. Inform. Process. Lett., 23(6):311-316, 1986.
319. Kantorowitz, E. and Laor, H. Automatic generation of useful syntax error messages. Softw. Pract. Exper., 16(7):627-640, July 1986.
320. Burke, Michael G. and Fisher, Gerald A. A practical method for LL and LR syntactic error diagnosis and recovery. ACM Trans. Prog. Lang. Syst., 9(2):164-197, April 1987.
321. Cormack, Gordon V. An LR substring parser for noncorrecting syntax error recovery. ACM SIGPLAN Notices, 24(7):161-169, June 1989.
322. Charles, Philippe. An LR(k) error diagnosis and recovery method. In Second International Workshop on Parsing Technologies, pages 89-99, Feb. 1991.
323. Deudekom, A. and Kooiman, P. Top-down non-correcting error recovery in LLgen. Technical Report IR 338, Vrije Universiteit, Faculteit Wiskunde en Informatica, Amsterdam, Oct. 1993.
324. McKenzie, Bruce J., Yeatman, Corey, and De Vere, Lorraine. Error repair in shiftreduce parsers. ACM Trans. Prog. Lang. Syst., 17(4):672-689, July 1995.
325. Ruckert, Martin. Generating efficient substring parsers for BRC grammars. Technical Report 98-105, State University of New York at New Paltz, New Paltz, NY 12561, July 1998.
326. Bertsch, Eberhard and Nederhof, Mark-Jan. On failure of the pruning technique in "error repair in shift-reduce parsers". ACM Trans. Prog. Lang. Syst., 21(1):1-10, Jan. 1999.
327. Ruckert, Martin. Continuous grammars. In 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 303-310. ACM, 1999.
328. Cerecke, Carl. Repairing syntax errors in LR-based parsers. New Zealand J. Computing, 8(3):3-13, June 2001.
329. Kim, I.-S. and Choe, K.-M. Error repair with validation in LR-based parsing. ACM Trans. Prog. Lang. Syst., 23(4):451-471, 2001.
330. Corchuelo, Rafael, Perez, Jose A., Ruiz, Antonio, and Toro, Miguel. Repairing syntax errors in LR parsers. ACM Trans. Prog. Lang. Syst., 24(6):698-710, Nov. 2002.
331. Jeffery, Clinton L. Generating LR syntax error messages from examples. ACM Trans. Prog. Lang. Syst., 25(5):631-640, Sept. 2003.
332. Lindstrom, Gary. The design of parsers for incremental language processors. In Second Annual ACM Symposium on Theory of Computing, pages 81-91. ACM, 1970.
333. Degano, Pierpaolo, Mannucci, Stefano, and Mojana, Bruno. Efficient incremental LR parsing for syntax-directed editors. ACM Trans. Prog. Lang. Syst., 10(3):345-373, July 1988.
334. Vilares Ferro, M. and Dion, B. A. Efficient incremental parsing for context-free languages. In 1994 International Conference on Computer Languages, pages 241-252. IEEE Computer Society Press, May 1994.
335. Grau, A. A. Recursive processes and ALGOL translation. Commun. ACM, 4(1):10-15, Jan. 1961.
336. Conway, Melvin E. Design of a separable transition-diagram compiler. Commun. ACM, 6(7):396-408, July 1963.
337. Tarjan, R. E. Depth first search and linear graph algorithms. SIAM J. Computing, 1(2):146-160, 1972.
338. Aho, A. V., Johnson, S. C., and Ullman, J. D. Deterministic parsing of ambiguous grammars. Commun. ACM, 18(8):441-452, 1975.
339. Glanville, R. Steven and Graham, Susan L. A new method for compiler code generation (extended abstract). In Fifth Annual ACM Symposium on Principles of Programming Languages, pages 231-240, 1978.
340. Milton, D. R., Kirchhoff, L. W., and Rowland, B. R. An ALL(1) compiler generator. ACM SIGPLAN Notices, 14(8):152-157, Aug. 1979.
341. Dencker, Peter, Durre, Karl, and Heuft, Johannes. Optimization of parser tables for portable compilers. ACM Trans. Prog. Lang. Syst., 6(4):546-572, Oct. 1984.
342. Waite, W. M. and Carter, L. R. The cost of a generated parser. Softw. Pract. Exper., 15(3):221-237, 1985.
343. Aho, A. V., Sethi, R., and Ullman, J. D. Compilers: Principles, Techniques and Tools. Addison-Wesley, Reading, Mass., 1986.
344. Cohen, Jacques and Hickey, Timothy J. Parsing and compiling using Prolog. ACM Trans. Prog. Lang. Syst., 9(2):125-164, April 1987.
345. Koskimies, Kai. Lazy recursive descent parsing for modular language implementation. Softw. Pract. Exper., 20(8):749-772, Aug. 1990.
346. Norvig, P. Techniques for automatic memoization with applications to context-free parsing. Computational Linguistics, 17(1):91-98, March 1991.
347. Frost, Richard A. Constructing programs as executable attribute grammars. Computer J., 35(4):376-389, 1992.
348. Hutton, Graham. Higher-order functions for parsing. J. Functional Programming, 2(3):323-343, 1992.
349. Leermakers, Rene, Augusteijn, Lex, and Kruseman Aretz, Frans E. J. A functional LR parser. Theoret. Comput. Sci., 104:313-323, 1992.
350. Rekers, J. Parser Generation for Interactive Environments. PhD thesis, Technical report, Leiden University, Leiden, 1992.
351. Bod, R. Using an annotated language corpus as a virtual stochastic grammar. In Proceedings of the 11th National Conference on Artificial Intelligence, pages 778-783, Washington, DC, 1993.
352. Nederhof, M.-J. and Sarbo, J. J. Efficient decoration of parse forests. In H. Trost, editor, Feature Formalisms and Linguistic Ambiguity, pages 53-78. Ellis Horwood, 1993.
353. Frost, R. A. Using memoization to achieve polynomial complexity of purely functional executable specifications of non-deterministic top-down parsers. ACM SIGPLAN Notices, 29(4):23-30, April 1994.
354. Johnson, Mark. Memoization in top-down parsing. Computational Linguistics, 21(3):405-418, 1995.
355. Kurapova, E. W. and Ryabko, B. Y. Using formal grammars for source coding. Problems of Information Transmission, 31(1):28-32, 1995, (in Russian).
356. Frost, Richard A. and Szydlowski, Barbara. Memoizing purely functional top-down backtracking language processors. Sci. Comput. Progr., 27(3):263-288, Nov. 1996.
357. Bhamidipaty, A. and Proebsting, T. A. Very fast YACC-compatible parsers (for very little effort). Softw. Pract. Exper., 28(2):181-190, 1998.
358. Clark, C. Build a tree - save a parse. ACM SIGPLAN Notices, 34(4):19-24, April 1999.
359. Sperber, Michael and Thiemann, Peter. Generation of LR parsers by partial evaluation. ACM Trans. Prog. Lang. Syst., 22(2):224-264, 2000.
360. Metsker, Steven John. Building Parsers with Java. Addison Wesley, 2001.
361. Ljunglof, Peter. Pure Functional Parsing: An Advanced Tutorial. PhD thesis, Technical Report 6L, Chalmers University of Technology, Goteborg, April 2002.
362. Sperberg-McQueen, C. M. Applications of Brzozowski derivatives to XML schema processing. In Extreme Markup Languages 2005, page 26, Internet, 2005.
363. Lesk, M. E. and Schmidt, E. Lex: A Lexical Analyzer Generator. In UNIX Manuals, page 13. Bell Laboratories, Murray Hill, New Jersey, 1975.
364. Johnson, Stephen C. YACC: Yet Another Compiler-Compiler. Technical report, Bell Laboratories, Murray Hill, New Jersey 07974, 1978.
365. Grune, Dick and Jacobs, Ceriel J. H. A programmer-friendly LL(1) parser generator. Softw. Pract. Exper., 18(1):29-38, Jan. 1988.
366. Johnstone, Adrian and Scott, Elizabeth. An iterator-based recursive descent parser generator with tree promotion operators. ACM SIGPLAN Notices, 33(9):87-94, Sept. 1998.
367. Kernighan, B. W. and Cherry, L. L. A system for typesetting mathematics. Commun. ACM, 18(3):151-157, March 1975.
368. Share, Michael. Resolving ambiguities in the parsing of translation grammars. ACM SIGPLAN Notices, 23(8):103-109, Aug. 1988.
369. Evans, William S. Compression via guided parsing. In Data Compression Conference 1998, pages 544-553. IEEE, 1998.
370. Evans, William S. and Fraser, Christopher W. Bytecode compression via profiled grammar rewriting. ACM SIGPLAN Notices, 36(5):148-155, May 2001.
371. Pereira, Fernando C. N. and Warren, David H. D. Parsing as deduction. In 21st Annual Meeting of the Association for Computational Linguistics, pages 137-144, Cambridge, Mass., 1983.
372. Vilain, Marc. Deduction as parsing: Tractable classification in the KL-ONE framework. In National Conf. on Artificial Intelligence (AAAI-91), Vol. 1, pages 464-470, 1991.
373. Rosenblueth, David A. Chart parsers as inference systems for fixed-mode logic programs. New Generation Computing, 14(4):429-458, 1996.
374. Rosenblueth, David A. and Peralta, Julio C. SLR inference: An inference system for fixed-mode logic programs based on SLR parsing. J. Logic Programming, 34(3):227- 259, 1998.
375. Vilares Ferro, Manuel and Alonso Pardo, Miguel A. An LALR extension for DCGs in dynamic programming. In Carlos Martin Vide, editor, Mathematical and Computational Analysis of Natural Language, volume 45 of Studies in Functional and Structural Linguistics, pages 267-278. John Benjamins, 1998.
376. Morawietz, Frank. Chart parsing and constraint programming. In 18th International Conference on Computational Linguistics: COLING 2000, pages 551-557, Internet, 2000. ACL.
377. Erk, Katrin and Kruijff, Geert-Jan M. A constraint-programming approach to parsing with resource-sensitive categorial grammar. In Natural Language Understanding and Logic Programming (NLULP'02), pages 69-86, Roskilde, Denmark, July 2002.
378. Yngve, Victor H. A model and an hypothesis for language structure. Proceedings of the American Philosophical Society, 104(5):444-466, Oct. 1960.
379. Dewar, Hamish P., Bratley, Paul, and Thorne, James P. A program for the syntactic analysis of English sentences. Commun. ACM, 12(8):476-479, 1969.
380. Chester, Daniel. A parsing algorithm that extends phrases. Am. J. Computational Linguistics, 6(2):87-96, April 1980.
381. Woods, William A. Cascaded ATN grammars. Am. J. Computational Linguistics, 6(1):1-12, Jan. 1980.
382. Shieber, Stuart M. Direct parsing of ID/LP grammars. Linguistics and Philosophy, 7:135-154, 1984.
383. Blank, Glenn D. A new kind of finite-state automaton: Register vector grammar. In Ninth International Conference on Artificial Intelligence, pages 749-756. UCLA, Aug. 1985.
384. Gazdar, Gerald, Klein, Ewan, Pullum, Geoffrey, and Sag, Ivan. Generalized Phrase Structure Grammar. Basil Blackwell Publisher, Ltd., Oxford, UK, 1985.
385. Blank, Glenn D. A finite and real-time processor for natural language. Commun. ACM, 32(10):1174-1189, Oct. 1989.
386. Abney, Steven P. and Johnson, Mark. Memory requirements and local ambiguities of parsing strategies. J. Psycholing. Res., 20(3):233-250, 1991.
387. Resnik, Philip. Left-corner parsing and psychological plausibility. In 14th International Conference on Computational Linguistics, pages 191-197. Association for Computational Linguistics, 1992.
388. Chomsky, Noam. On certain formal properties of grammars. Inform. Control, 2:137- 167, 1959.
389. Bar-Hillel, Y., Perles, M., and Shamir, E. On formal properties of simple phrase structure grammars. Zeitschrift für Phonetik, Sprachwissenschaft und Kommunikationsforschung, 14:143-172, 1961.
390. Y. Bar-Hillel, Language and Information: Essays on their Theory and Application, Addison-Wesley, 1964, pp. 116- 150.
391. Haines, Leonard H. On free monoids partially ordered by embedding. J. Combinatorial Theory, 6:94-98, 1969.
392. Cook, Steven A. Linear time simulation of deterministic two-way pushdown automata. In IFIP Congress (1), pages 75-80, 1971.
393. Greibach, Sheila A. The hardest context-free language. SIAM J. Computing, 2(4):304- 310, Dec. 1973.
394. Liu, Leonard Y. and Weiner, Peter. An infinite hierarchy of intersections of contextfree languages. Math. Syst. Theory, 7(2):185-192, May 1973.
395. Hopcroft, John E. and Ullman, Jeffrey D. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Massachussetts, 1979.
396. Heilbrunner, Stephan. Tests for the LR-, LL-, and LC-regular conditions. J. Comput. Syst. Sci., 27(1):1-13, 1983.
397. Rayward-Smith, V. J. A First Course in Formal Languages. Blackwell Scientific, Oxford, 1983.
398. Revesz, Gyorgy E. Introduction to Formal Languages. McGraw-Hill, Singapore, 1985.
399. Geffert, Viliam. A representation of recursively enumerable languages by two homomorphisms and a quotient. Theoret. Comput. Sci., 62:235-249, 1988.
400. Billington, David. Using the context-free pumping lemma. Commun. ACM, 36(4):21, 81, April 1993.
401. Sudkamp, Thomas A. Languages and Machines. Addison-Wesley, second edition, 1997.
402. Schmitz, Sylvain. Conservative ambiguity detection in context-free grammars. Technical Report RR-2006-30-FR, Universite de Nice, 2006.
403. Pereira, Fernando C. N. and Wright, Rebecca N. Finite-state approximation of phrasestructure grammars. In 29th Annual Meeting of the Association for Computational Linguistics, pages 246-255. Association for Computational Linguistics, 1991.
404. Pereira, Fernando C. N. and Wright, Rebecca N. Finite-state approximation of phrasestructure grammars. In Emmanuel Roche and Yves Schabes, editors, Finite-State Language Processing, pages 149-173. MIT Press, 1997.
405. Nederhof, Mark-Jan. Regular approximations of CFLs: A grammatical view. In H. Bunt and A. Nijholt, editors, Advances in Probabilistic and Other Parsing Technologies, pages 221-241. Kluwer Academic Publishers, 2000.
406. Nederhof, Mark-Jan. Practical experiments with regular approximation of context-free languages. Computational Linguistics, 26(1):17-44, 2000.
407. Yli-Jyra, Anssi. Regular approximations through labeled bracketing. In Formal Grammar 2003, pages 189-201. 2003.
408. Pereira, Fernando C. N. and Wright, Rebecca N. Finite-state approximation of phrasestructure grammars. Technical report, AT&T Reseach, Murray Hill, NJ, March 2005.
409. Foster, J. M. A syntax-improving program. Computer J., 11(1):31-34, May 1968.
410. Hammer, Michael. A new grammatical transformation into LL(k) form. In Sixth Annual ACMSymposium on Theory of Computing, pages 266-275, 1974.
411. Mickunas, M. D., Lancaster, R. L., and Schneider, V. B. Transforming LR(k) grammars to LR(1), SLR(1) and (1, 1) bounded right-context grammars. J. ACM, 23(3):511-533, July 1976.
412. Rosenkrantz, D. J. and Hunt, H. B. Efficient algorithms for automatic construction and compactification of parsing grammars. ACM Trans. Prog. Lang. Syst., 9(4):543-566, Oct. 1987.
413. Warshall, Stephen. A theorem on boolean matrices. J. ACM, 9(1):11-12, 1962.
414. Michie, D. Functions and machine learning. Nature, 218(5136):19-22, April 6 1968.
415. Bhate, Saroja and Kak, Subhash. Grammar and computer science. Annals of the Bhandarkar Oriental Research Institute, 72:79-94, 1993.
416. Nuutila, Esko. An efficient transitive closure algorithm for cyclic digraphs. Inform. Process. Lett., 52(4):207-213, Nov. 1994.
417. Thompson, Simon. Haskell: The Craft of Functional Programming. Addison Wesley, Harlow, England, 2nd edition, March 1999.
418. Grune, Dick, Bal, Henri E., Jacobs, Ceriel J. H., and Langendoen, Koen G. Modern Compiler Design. John Wiley, Chichester, UK, 2000.
419. Cormen, Thomas H., Leiserson, Charles E., Rivest, Ronald L., and Stein, Clifford. Introduction to Algorithms. MIT Press, 2nd edition, 2001.
420. Goodrich, Michael T. and Tamassia, Roberto. Algorithm Design: Foundations, Analysis, and Internet Examples. John Wiley and Sons, 2nd edition, 2002.
421. Sedgewick, Robert. Algorithms in C/C++/Java: Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms. Addison-Wesley, Reading, Mass., 2001/2002.