The Theory of Parsing, Translation, and Compiling

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

The Theory of Parsing, Translation, and Compiling

Source

Pages: 592

Medium: Hardcover

Year of Publication: 1972

ISBN:0139145567

Authors

Alfred V. Aho
Jeffrey D. Ullman

Publisher

Prentice Hall Professional Technical Reference

Bibliometrics

Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 270

Additional Information:

cited by index terms collaborative colleagues

Tools and Actions:	Review this Book Save this Book to a Binder Display Formats: BibTeX EndNote ACM Ref

CITED BY 270

	S. M. Leinwand, Logical correctness by construction, Proceedings of the 19th conference on Design automation, p.825-831, January 1982
	Benton L. Leong , Detlef Wotschke, The influence of productions on derivations and parsing (Extended Abstract), Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages, p.1-11, January 19-21, 1976, Atlanta, Georgia
	Marvin V. Zelkowitz, Perspectives in Software Engineering, ACM Computing Surveys (CSUR), v.10 n.2, p.197-216, June 1978
	William R. Haynes, Jr. , Charles E. Hughes , Charles P. Pfleeger, ORACLE a tool for learning compiler writing, ACM SIGCSE Bulletin, v.9 n.1, p.37-52, Feb 1977
	Adam L. Buchsbaum , Haim Kaplan , Anne Rogers , Jeffery R. Westbrook, Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.279-288, May 24-26, 1998, Dallas, Texas, United States
	Mario Schkolnick, Labelled precedence parsing, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.33-40, October 01-03, 1973, Boston, Massachusetts
	Pierre LeBeux, Selection processes and their relation to automata, Proceedings of the annual conference, p.336-341, August 27-29, 1973, Atlanta, Georgia, United States
	Thomas J. Sager, A short proof of a conjecture of De Remer and Pennello, ACM Transactions on Programming Languages and Systems (TOPLAS), v.8 n.2, p.264-271, April 1986
	Kou-Chung Tai, Noncanonical SLR(1) Grammars, ACM Transactions on Programming Languages and Systems (TOPLAS), v.1 n.2, p.295-320, Oct. 1979
	Antonio P. Bongulielmi , Francois E. Cellier, On the usefulness of deterministic grammars for simulation languages, ACM SIGSIM Simulation Digest, v.15 n.1, January 1984
	I. H. Sudborough, Separating tape bounded auxiliary pushdown automata classes, Proceedings of the ninth annual ACM symposium on Theory of computing, p.208-217, May 04-04, 1977, Boulder, Colorado, United States
	Robert Endre Tarjan, Fast Algorithms for Solving Path Problems, Journal of the ACM (JACM), v.28 n.3, p.594-614, July 1981
	K. Humenik , R. S. Pinkham, Production probability estimators for context-free grammars, Proceedings of the 1986 ACM fourteenth annual conference on Computer science, p.173-181, February 1986, Cincinnati, Ohio, United States
	Joseph E. Requa, The Piecewise Data Flow architecture control flow and register management, ACM SIGARCH Computer Architecture News, v.11 n.3, p.84-89, June 1983
	Robert M. Keller , Gary Lindstrom, Applications of feedback in functional programming, Proceedings of the 1981 conference on Functional programming languages and computer architecture, p.123-130, October 18-22, 1981, Portsmouth, New Hampshire, United States
	Jae-Hoon Kim , Joon-Hong Kim , Dosam Hwang, Korean text summarization using an aggregate similarity, Proceedings of the fifth international workshop on on Information retrieval with Asian languages, p.111-118, September 30-October 01, 2000, Hong Kong, China
	R. S. Bird, Tabulation Techniques for Recursive Programs, ACM Computing Surveys (CSUR), v.12 n.4, p.403-417, Dec. 1980
	Adam L. Buchsbaum , Haim Kaplan , Anne Rogers , Jeffery R. Westbrook, A new, simpler linear-time dominators algorithm, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.6, p.1265-1296, Nov. 1998
	Jacqueline Spiesser , Les Kitchen, Optimization of html automatically generated by wysiwyg programs, Proceedings of the 13th international conference on World Wide Web, May 17-20, 2004, New York, NY, USA
	Robert H. Bonczek , James I. Cash , Andrew B. Whinston, A transformational grammar-based query processor for access control in a planning system, ACM Transactions on Database Systems (TODS), v.2 n.4, p.326-338, Dec. 1977
	Susan L. Graham , Michael Harrison and Walter L. Ruzzo, An Improved Context-Free Recognizer, ACM Transactions on Programming Languages and Systems (TOPLAS), v.2 n.3, p.415-462, July 1980
	R. W. Matzen , K. M. George , G. E. Hedrick, A model for studying ambiguity in SGML element declarations, Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, p.665-676, February 14-16, 1993, Indianapolis, Indiana, United States
	Yael Krevner , Amiram Yehudai, An Iteration Theorem for Simple Precedence Languages, Journal of the ACM (JACM), v.30 n.4, p.820-833, Oct. 1983
	Joseph Bates , Alon Lavie, Recognizing substrings of LR(k) languages in linear time, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.235-245, January 19-22, 1992, Albuquerque, New Mexico, United States
	Pyda Srisuresh , Michael J. Eager, A portable syntactic error recovery scheme for LR(1) parsers, Proceedings of the 1985 ACM thirteenth annual conference on Computer Science, p.390-399, March 1985, New Orleans, Louisiana, United States
	S. Ron Oliver , Nell D. Jones, Program control via transition matrices—a novel application of micro-programming, ACM SIGPLAN Notices, v.11 n.4, p.70-77, April 1976
	Roland Backhouse, Global Data Flow Analysis Problems Arising in Locally Least-Cost Error Recovery, ACM Transactions on Programming Languages and Systems (TOPLAS), v.6 n.2, p.192-214, April 1984
	Thomas J. Pennello , Frank DeRemer, A forward move algorithm for LR error recovery, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.241-254, January 23-25, 1978, Tucson, Arizona
	Eljas Soisalon-Soininen, Elimination of single productions from LR parsers in conjunction with the use of default reductions, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.183-193, January 17-19, 1977, Los Angeles, California
	Eljas Soisalon-Soininen, Elimination of single productions from LR parsers in conjunction with the use of default reductions, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.183-193, January 17-19, 1977, Los Angeles, California
	B. K. Seyed-Abbassi , J. C. Thompson, G-base fourth normal form in relational database, Proceedings of the 17th conference on ACM Annual Computer Science Conference, p.54-61, February 21-23, 1989, Louisville, Kentucky
	C. N. Fischer , D. R. Milton , S. B. Quiring, An efficient insertion-only error-corrector for LL(1) parsers, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.97-103, January 17-19, 1977, Los Angeles, California
	Mehdi Jazayeri , William F. Ogden , William C. Rounds, The intrinsically exponential complexity of the circularity problem for attribute grammars, Communications of the ACM, v.18 n.12, p.697-706, Dec. 1975
	Mario Schkolnick, The equivalence of reducing transition languages and deterministic languages, Communications of the ACM, v.17 n.9, p.517-520, Sept. 1974
	Ira R. Forman, Global data flow analysis by decomposition into primes, Proceedings of the 6th international conference on Software engineering, p.386-392, September 13-16, 1982, Tokyo, Japan
	A. V. Aho , S. C. Johnson, LR Parsing, ACM Computing Surveys (CSUR), v.6 n.2, p.99-124, June 1974
	A. V. Aho , S. C. Johnson, LR Parsing, ACM Computing Surveys (CSUR), v.6 n.2, p.99-124, June 1974
	David A. Workman , John B. Higdon, The design of a parser generator, Proceedings of the 16th annual Southeast regional conference, p.82-86, April 13-15, 1978, Atlanta, Georgia
	Jean Tague , Airi Salminen , Charles McClellan, Complete formal model for information retrieval systems, Proceedings of the 14th annual international ACM SIGIR conference on Research and development in information retrieval, p.14-20, October 13-16, 1991, Chicago, Illinois, United States
	R. M. Mattheyses , S. E. Conry, Models for specification and anaysis of parallel computing systems, ACM SIGSIM Simulation Digest, v.11 n.1, p.215-224, Fall 1979
	Bernd Krämer , Heinz-Wilhelm Schmidt, Developing Integrated Environments with ASDL, IEEE Software, v.6 n.1, p.98-107, January 1989
	I. H. Sudborough, On the Tape Complexity of Deterministic Context-Free Languages, Journal of the ACM (JACM), v.25 n.3, p.405-414, July 1978
	H. B. Hunt, III, Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes, Journal of the ACM (JACM), v.31 n.2, p.299-318, April 1984
	Joseph M. Morris , Mayer D. Schwartz, The design of a language-directed editor for block-structured languages, ACM SIGPLAN Notices, v.16 n.6, p.28-33, June 1981
	Carlo Ghezzi , Dino Mandrioli, Augmenting Parsers to Support Incrementality, Journal of the ACM (JACM), v.27 n.3, p.564-579, July 1980
	Ivan M. Havel , Michael A. Harrison, On the Parsing of Deterministic Languages, Journal of the ACM (JACM), v.21 n.4, p.525-548, Oct. 1974
	Frank DeRemer , Thomas Pennello, Efficient Computation of LALR(1) Look-Ahead Sets, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.4, p.615-649, Oct. 1982
	Amelia Fong , John Kam , Jeffrey Ullman, Application of lattice algebra to loop optimization, Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.1-9, January 20-22, 1975, Palo Alto, California
	Susan L. Graham , Steven P. Rhodes, Practical syntactic error recovery, Communications of the ACM, v.18 n.11, p.639-650, Nov. 1975
	James R. Bitner , Edward M. Reingold, Backtrack programming techniques, Communications of the ACM, v.18 n.11, p.651-656, Nov. 1975
	Wilf R. LaLonde , Jim des Rivieres, Handling Operator Precedence in Arithmetic Expressions with Tree Transformations, ACM Transactions on Programming Languages and Systems (TOPLAS), v.3 n.1, p.83-103, Jan. 1981
	Wilf R. LaLonde, The Construction of Stack-Controlling LR Parsers for Regular Right Part Grammars, ACM Transactions on Programming Languages and Systems (TOPLAS), v.3 n.2, p.168-206, April 1981
	A. V. Aho , S. C. Johnson , J. D. Ullman, Deterministic parsing of ambiguous grammars, Communications of the ACM, v.18 n.8, p.441-452, Aug. 1975
	Bryan Ford, Packrat parsing:: simple, powerful, lazy, linear time, functional pearl, ACM SIGPLAN Notices, v.37 n.9, p.36-47, September 2002
	H. B. Hunt, III , D. J. Rosenkrantz, Efficient algorithms for structural similarity of grammars, Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.213-219, January 28-30, 1980, Las Vegas, Nevada
	Martin Jourdan, Strongly non-circular attribute grammars and their recursive evaluation, ACM SIGPLAN Notices, v.19 n.6, p.81-93, June 1984
	Andreas Geyer-Schulz , Thomas Kolarik, Distributed computing with APL, ACM SIGAPL APL Quote Quad, v.23 n.1, p.60-69, July 1992
	Pradip Bose , B. R. Rau , M. S. Schlansker, Systematically derived instruction sets for high-level language support, Proceedings of the 20th annual Southeast regional conference, p.73-84, April 01-03, 1982, Knoxville, Tennessee
	Thomas Lengauer , Robert Endre Tarjan, A fast algorithm for finding dominators in a flowgraph, ACM Transactions on Programming Languages and Systems (TOPLAS), v.1 n.1, p.121-141, July 1979
	John F. Jarvis, The line drawing editor, an experiment in computer vision, ACM SIGGRAPH Computer Graphics, v.10 n.2, p.288-292, Summer 1976
	Hae-Chang Rim , Jungyun Seo , Robert F. Simmons, Transforming syntactic graphs into semantic graphs, Proceedings of the 28th annual meeting on Association for Computational Linguistics, p.47-53, June 06-09, 1990, Pittsburgh, Pennsylvania
	Christoph M. Hoffmann , Michael J. O`Donnell, Implementation of an interpreter for abstract equations, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.111-121, January 15-18, 1984, Salt Lake City, Utah, United States
	Frank DeRemer , Thomas J. Pennello, Efficient computation of LALR(1) look-ahead sets, ACM SIGPLAN Notices, v.14 n.8, p.176-187, August 1979
	Joseph C.H. Park , K. M. Choe , C. H. Chang, A new analysis of LALR formalisms, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.1, p.159-175, Jan. 1985
	Thomas P. Murtagh, An improved storage management scheme for block structured languages, ACM Transactions on Programming Languages and Systems (TOPLAS), v.13 n.3, p.372-398, July 1991
	H. B. Hunt, III, On the Decidability of Grammar Problems, Journal of the ACM (JACM), v.29 n.2, p.429-447, April 1982
	H. B. Hunt, III , T. G. Szymanski, Dichotomization, reachability, and the forbidden subgraph problem(Extended Abstract), Proceedings of the eighth annual ACM symposium on Theory of computing, p.126-134, May 03-05, 1976, Hershey, Pennsylvania, United States
	Ajit B. Pai , Richard B. Kieburtz, Global Context Recovery: A New Strategy for Syntactic Error Recovery by Table-Drive Parsers, ACM Transactions on Programming Languages and Systems (TOPLAS), v.2 n.1, p.18-41, Jan. 1980
	Robert A. Mueller , Gearold R. Johnson, Contrasting translation, verification and synthesis in software and firmware engineering, ACM SIGMICRO Newsletter, v.12 n.4, p.17-22, Dec. 1981
	Pradip Bose , Edward S. Davidson, Design of instruction set architectures for support of high-level languages, ACM SIGARCH Computer Architecture News, v.12 n.3, p.198-206, June 1984
	Charles T. Hemphill , Philip R. Thrift, Surfing the Web by voice, Proceedings of the third ACM international conference on Multimedia, p.215-222, November 05-09, 1995, San Francisco, California, United States
	J. D. Bunda , J. A. Gerth, APL two by two-syntax analysis by pairwise reduction, ACM SIGAPL APL Quote Quad, v.14 n.4, p.85-94, June 1984
	John C. Thompson , Reza Sanati-Mehrizy, Formalization of operations and function definitions in a functional programming language for data structures, Proceedings of the 15th annual conference on Computer Science, p.210-219, February 1987, St. Louis, Missouri, United States
	Sheila A. Greibach, Some restrictions on W-grammars, Proceedings of the sixth annual ACM symposium on Theory of computing, p.256-265, April 30-May 02, 1974, Seattle, Washington, United States
	Michael Hammer, A new grammatical transformation into LL(k) form (Extended Abstract), Proceedings of the sixth annual ACM symposium on Theory of computing, p.266-275, April 30-May 02, 1974, Seattle, Washington, United States
	Ray Teitelbaum, Context-free error analysis by evaluation of algebraic power series, Proceedings of the fifth annual ACM symposium on Theory of computing, p.196-199, April 30-May 02, 1973, Austin, Texas, United States
	Steven L. Horowitz, A syntactic algorithm for peak detection in waveforms with applications to cardiography, Communications of the ACM, v.18 n.5, p.281-285, May 1975
	Wilf R. LaLonde, Technical Correspondence: Comments on Soisalon-Soininen's ``Inessential Error Entries and Their Use in LR Parser Optimization'', ACM Transactions on Programming Languages and Systems (TOPLAS), v.6 n.3, p.432-439, July 1984
	John H. Reif , Harry R. Lewis, Symbolic evaluation and the global value graph, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.104-118, January 17-19, 1977, Los Angeles, California
	Jan van Leeuwen, A partial solution to the reachability-problem for vector-addition systems, Proceedings of the sixth annual ACM symposium on Theory of computing, p.303-309, April 30-May 02, 1974, Seattle, Washington, United States
	Susan L. Graham , Mark Wegman, A Fast and Usually Linear Algorithm for Global Flow Analysis, Journal of the ACM (JACM), v.23 n.1, p.172-202, Jan. 1976
	Pierpaolo Degano , Stefano Mannucci , Bruno Mojana, Efficient incremental LR parsing for syntax-directed editors, ACM Transactions on Programming Languages and Systems (TOPLAS), v.10 n.3, p.345-373, July 1988
	Eugene W. Myers, Jr. , Leon J. Osterweil, BIGMAC II: A FORTRAN language augmentation tool, Proceedings of the 5th international conference on Software engineering, p.410-421, March 09-12, 1981, San Diego, California, United States
	Vance E. Waddle, Production trees: a compact representation of parsed programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.12 n.1, p.61-83, Jan. 1990
	Christopher Bader , Arnaldo Moura, A Generalization of Ogden's Lemma, Journal of the ACM (JACM), v.29 n.2, p.404-407, April 1982
	Eljas Soisalon-Soininen, Inessential Error Entries and Their Use in LR Parser Optimization, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.2, p.179-195, April 1982
	Arthur V. Lopes, Ada+SQL—an overview, ACM SIGAda Ada Letters, v.XIX n.3, p.157-162, Sept. 1999
	A. Nijholt, On the covering of left recursive grammars, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.86-96, January 17-19, 1977, Los Angeles, California
	H. B. Hunt, III , T. G. Szymanski, On the complexity of grammar and related problems, Proceedings of seventh annual ACM symposium on Theory of computing, p.54-65, May 05-07, 1975, Albuquerque, New Mexico, United States
	M. Dennis Mickunas , Richard M. Schell, Parallel Compilation In A Multiprocessor Environment (Extended Abstract), Proceedings of the 1978 annual conference, p.241-246, December 04-06, 1978, Washington, D.C., United States
	Neil D. Jones , William T. Laaser, Complete problems for deterministic polynomial time, Proceedings of the sixth annual ACM symposium on Theory of computing, p.40-46, April 30-May 02, 1974, Seattle, Washington, United States
	C. S. Wetherell, Probabilistic Languages: A Review and Some Open Questions, ACM Computing Surveys (CSUR), v.12 n.4, p.361-379, Dec. 1980
	Annika Aasa, Precedences for conctypes, Proceedings of the conference on Functional programming languages and computer architecture, p.83-91, June 09-11, 1993, Copenhagen, Denmark
	Thomas Russi, A syntactic and morphological analyzer for a text-to-speech system, Proceedings of the 13th conference on Computational linguistics, p.443-445, August 20-25, 1990, Helsinki, Finland
	Eberhard Bertsch, The storage requirement in precedence parsing, Communications of the ACM, v.20 n.3, p.192-194, March 1977
	Esko Ukkonen , Eljas Soisalon-Soininen, LALR(k) testing is PSPACE-complete, Proceedings of the thirteenth annual ACM symposium on Theory of computing, p.202-206, May 11-13, 1981, Milwaukee, Wisconsin, United States
	Joseph Bates , Alon Lavie, Recognizing substrings of LR(k) languages in linear time, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.3, p.1051-1077, May 1994
	Joseph L. Linn, Techniques for the construction of small and fast lexical analyzers, Proceedings of the 16th annual Southeast regional conference, p.265-268, April 13-15, 1978, Atlanta, Georgia
	Susan L. Graham , Michael A. Harrison , Walter L. Ruzzo, On line context free language recognition in less than cubic time(Extended Abstract), Proceedings of the eighth annual ACM symposium on Theory of computing, p.112-120, May 03-05, 1976, Hershey, Pennsylvania, United States
	G. David Ripley, A simple recovery-only procedure for simple precedence parsers, Communications of the ACM, v.21 n.11, p.928-930, Nov. 1978
	Matthew M. Geller , Michael A. Harrison, Strict deterministic versus LR(0) parsing, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.22-32, October 01-03, 1973, Boston, Massachusetts
	Thomas P. Murtagh, A less dynamic memory allocation scheme for algol-like languages, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.283-289, January 15-18, 1984, Salt Lake City, Utah, United States
	D Harel, A linear algorithm for finding dominators in flow graphs and related problems, Proceedings of the seventeenth annual ACM symposium on Theory of computing, p.185-194, May 06-08, 1985, Providence, Rhode Island, United States
	Eugene V. Zima, On computational properties of chains of recurrences, Proceedings of the 2001 international symposium on Symbolic and algebraic computation, p.345, July 2001, London, Ontario, Canada
	Diane Pozefsky , Mehdi Jazayeri, A Family Of Pass-Oriented Attribute Grammar Evaluators, Proceedings of the 1978 annual conference, p.261-270, December 04-06, 1978, Washington, D.C., United States
	Lawrence J. Henschen , Shamim A. Naqvi, On compiling queries in recursive first-order databases, Journal of the ACM (JACM), v.31 n.1, p.47-85, Jan. 1984
	Uwe F. Pleban, The use of transition matrices in a recursive-descent compiler, ACM SIGPLAN Notices, v.14 n.8, p.144-151, August 1979
	Ajit B. Pai , Richard B. Kieburtz, Global context recovery: A new strategy for parser recovery from syntax errors, ACM SIGPLAN Notices, v.14 n.8, p.158-167, August 1979
	Chen Haiming, Combining CFG and recursive functions to get a new language, ACM SIGPLAN Notices, v.34 n.1, p.351, Jan. 1999
	Harry B. Hunt, III , Thomas G. Szymanski , Jeffrey D. Ullman, On the complexity of LR(k) testing, Communications of the ACM, v.18 n.12, p.707-716, Dec. 1975
	Ira R. Forman, An algebra for data flow anomaly detection, Proceedings of the 7th international conference on Software engineering, p.278-286, March 26-29, 1984, Orlando, Florida, United States
	Christoph M. Hoffman , Michael J. O'Donnell, Programming with Equations, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.1, p.83-112, Jan. 1982
	Hans Leiss, On Kilbury's modification of Earley's algorithm, ACM Transactions on Programming Languages and Systems (TOPLAS), v.12 n.4, p.610-640, Oct. 1990
	Walling R. Cyre, Capture, Integration, and Analysis of Digital System Requirements with Conceptual Graphs, IEEE Transactions on Knowledge and Data Engineering, v.9 n.1, p.8-23, January 1997
	G. Chroust , J. R. Mühlbacher, Rivalling multiprocessor organization: a hardware/speed trade-off, ACM SIGARCH Computer Architecture News, v.8 n.5, p.7-10, August 1980
	Giorgio Satta, Recognition of linear context-free rewriting systems, Proceedings of the 30th annual meeting on Association for Computational Linguistics, p.89-95, June 28-July 02, 1992, Newark, Delaware
	Boris Chidlovskii , Jérôme Fuselier, Supervised learning for the legacy document conversion, Proceedings of the 2004 ACM symposium on Document engineering, October 28-30, 2004, Milwaukee, Wisconsin, USA
	Laurette Pretorius , Sonja E. Bosch, Enabling computer interaction in the indigenous languages of South Africa: the central role of computational morphology, interactions, v.10 n.2, March + April 2003
	Dafydd Gibbon, Finite state processing of tone systems, Proceedings of the third conference on European chapter of the Association for Computational Linguistics, p.291-297, April 01-03, 1987, Copenhagen, Denmark
	David C. Luckham, A brief account: Implementation and applications of a Pascal program verifier (Position Statement), Proceedings of the 1978 annual conference, p.786-792, January 1978
	Cem Bozsahin, The combinatory morphemic lexicon, Computational Linguistics, v.28 n.2, p.145-186, June 2002
	C. Frydman , M. Le Goc , L. Torres , N. Giambiasi, Using DEVS Formalism to operationalize ELP Models for diagnosis in SACHEM, Transactions of the Society for Computer Simulation International, v.18 n.3, p.147-158, September 2001
	Gábor Kovács , Zoltán Pap , Gyula Csopaki, Automatic test selection based on CEFSM specifications, Acta Cybernetica, v.15 n.4, p.583-599, December 2002
	Ferucio Laurenţiu Ţiplea , Erkki Mäkinen, On the complexity of a problem on monadic string rewriting systems, Journal of Automata, Languages and Combinatorics, v.7 n.4, p.599-609, September 2002
	René Krenz , Elena Dubrova, A fast algorithm for finding common multiple-vertex dominators in circuit graphs, Proceedings of the 2005 conference on Asia South Pacific design automation, January 18-21, 2005, Shanghai, China
	Daniel Chester, A parsing algorithm that extends phrases, Computational Linguistics, v.6 n.2, p.87-96, April-June 1980
	Jürgen Albert , Dora Giammarresi , Derick Wood, Normal form algorithms for extended context-free grammars, Theoretical Computer Science, v.267 n.1-2, p.35-47, 09/26/2001
	Charles Haspel, The portable computer in the classroom, ACM SIGCUE Outlook, v.12 n.3, p.4-12, July 1978
	Stef. W. Postma, FEA: a formal English subset for Algebra/Assertions, ACM SIGPLAN Notices, v.13 n.7, p.43-59, July 1978
	Mikio Nakano, Constraint projection: an efficient treatment of disjunctive feature descriptions, Proceedings of the 29th annual meeting on Association for Computational Linguistics, p.307-314, June 18-21, 1991, Berkeley, California
	Toru Hitaka , Sho Yoshida, A syntax parser based on the case dependency grammar and its efficiency, Proceedings of the 8th conference on Computational linguistics, September 30-October 04, 1980, Tokyo, Japan
	David Milward, Dynamics, dependency grammar and incremental interpretation, Proceedings of the 14th conference on Computational linguistics, August 23-28, 1992, Nantes, France
	Bryan Ford, Parsing expression grammars: a recognition-based syntactic foundation, ACM SIGPLAN Notices, v.39 n.1, p.111-122, January 2004
	Dekai Wu , Hongsing Wong Hkust, Machine translation with a stochastic grammatical channel, Proceedings of the 17th international conference on Computational linguistics, p.1408-1415, August 10-14, 1998, Montreal, Quebec, Canada
	Hiyan Alshawi , Shona Douglas , Srinivas Bangalore, Learning dependency translation models as collections of finite-state head transducers, Computational Linguistics, v.26 n.1, p.45-60, March 2000
	Wilf R. LaLonde, A finite state approach to operator classification, ACM SIGPLAN Notices, v.14 n.1, p.46-54, January 1979
	C. Raymond Perrault, On the mathematical properties of linguistic theories, Computational Linguistics, v.10 n.3-4, p.165-176, July-December 1984
	John Aycock, Why bison is becoming extinct, Crossroads, v.7 n.5, p.3-3, Mid summer 2001
	Esther König, The complexity of parsing with extended categorial grammars, Proceedings of the 13th conference on Computational linguistics, p.233-238, August 20-25, 1990, Helsinki, Finland
	Ralph Grishman , Mahesh Chitrao, Evaluation of a parallel chart parser, Proceedings of the second conference on Applied natural language processing, February 09-12, 1988, Austin, Texas
	Eila Kuikka , Paula Leinonen , Martti Penttonen, Towards automating of document structure transformations, Proceedings of the 2002 ACM symposium on Document engineering, November 08-09, 2002, McLean, Virginia, USA
	Ralph M. Weischedel , Norman K. Sondheimer, Meta-rules as a basis for processing ill-formed input, Computational Linguistics, v.9 n.3-4, July-December 1983
	Irina Prodanof , Giacomo Ferrari, Extended access to the left context in an ATN parser, Proceedings of the first conference on European chapter of the Association for Computational Linguistics, p.58-65, September 01-02, 1983, Pisa, Italy
	Fernando C. N. Pereira , David H. D. Warren, Parsing as deduction, Proceedings of the 21st annual meeting on Association for Computational Linguistics, June 15-17, 1983, Cambridge, Massachusetts
	Nelson Correa, An attribute-grammar implementation of Government-binding theory, Proceedings of the 25th annual meeting on Association for Computational Linguistics, p.45-51, July 06-09, 1987, Stanford, California
	C. Raymond Perrault, On the mathematical properties of linguistic theories, Proceedings of the 21st annual meeting on Association for Computational Linguistics, June 15-17, 1983, Cambridge, Massachusetts
	Dekai Wu, Stochastic inversion transduction grammars and bilingual parsing of parallel corpora, Computational Linguistics, v.23 n.3, p.377-403, September 1997
	Mark Johnson, PCFG models of linguistic tree representations, Computational Linguistics, v.24 n.4, p.613-632, December 1998
	Mark Johnson, Finite-state approximation of constraint-based grammars using left-corner grammar transforms, Proceedings of the 17th international conference on Computational linguistics, August 10-14, 1998, Montreal, Quebec, Canada
	René Leermakers, How to cover a grammar, Proceedings of the 27th annual meeting on Association for Computational Linguistics, p.135-142, June 26-29, 1989, Vancouver, British Columbia, Canada
	Owen Rambow , Giorgio Satta, Synchronous models of language, Proceedings of the 34th annual meeting on Association for Computational Linguistics, p.116-123, June 24-27, 1996, Santa Cruz, California
	Charles N. Fischer, On Parsing and Compiling Arithmetic Expressions on Vector Computers, ACM Transactions on Programming Languages and Systems (TOPLAS), v.2 n.2, p.203-224, April 1980
	Wilf R. LaLonde, Regular right part grammars and their parsers, Communications of the ACM, v.20 n.10, p.731-741, Oct. 1977
	Bruce Litow, Computing a context-free grammar-generating series, Information and Computation, v.169 n.2, p.174-185, September 15, 2001
	Fahimeh Jalili , Jean H. Gallier, Building friendly parsers, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.196-206, January 25-27, 1982, Albuquerque, Mexico
	Jacques Cohen , Timothy Hickey , Joel Katcoff, Upper Bounds for Speedup in Parallel Parsing, Journal of the ACM (JACM), v.29 n.2, p.408-428, April 1982
	I. H. Sudborough, On deterministic context-free languages, multihead automata, and the power of an auxiliary pushdown store, Proceedings of the eighth annual ACM symposium on Theory of computing, p.141-148, May 03-05, 1976, Hershey, Pennsylvania, United States
	Bernd Krämer , Heinz-Wilhelm Schmidt, Object-oriented development of integrated programming environments with ASDL, Proceedings of the 1988 ACM SIGSMALL/PC symposium on ACTES, p.11-21, May 04-06, 1988, Cannes, France
	Thomas Kolarik, Extending the two-partner shared variable protocol to n partners, ACM SIGAPL APL Quote Quad, v.24 n.1, p.124-133, Aug. 1993
	Dora Giammarresi , Jean-Luc Ponty , Derick Wood , Djelloul Ziadi, A characterization of Thompson digraphs, Discrete Applied Mathematics, v.134 n.1-3, p.317-337, 05 January 2004
	Cezar Câmpeanu , Wing Hong Ho, The maximum state complexity for finite languages, Journal of Automata, Languages and Combinatorics, v.9 n.2-3, p.189-202, September 2004
	Harry B. Hunt, III , Thomas G. Szymanski , Jeffrey D. Ullman, On the complexity of LR(k) testing, Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.130-136, January 20-22, 1975, Palo Alto, California
	Hiroyasu Nogami , Yumiko Yoshimura , Shin-ya Amano, Parsing with look-ahead in real-time on-line translation system, Proceedings of the 12th conference on Computational linguistics, p.488-493, August 22-27, 1988, Budapest, Hungry
	Marian Boykan Pour-El, Computer Science And Recursion Theory, Proceedings of the 1978 annual conference, p.15-20, December 04-06, 1978, Washington, D.C., United States
	Roy H. Campbell , Peter A. Kirslis, The SAGA project: A system for software development, ACM SIGPLAN Notices, v.19 n.5, p.73-80, May 1984
	Mats Wirén, A comparison of rule-invocation strategies in context-free chart parsing, Proceedings of the third conference on European chapter of the Association for Computational Linguistics, p.226-233, April 01-03, 1987, Copenhagen, Denmark
	Airi Salminen , Jean Tague-Sutcliffe , Charles McClellan, From text to hypertext by indexing, ACM Transactions on Information Systems (TOIS), v.13 n.1, p.69-99, Jan. 1995
	Robert W. Floyd, The paradigms of programming, Communications of the ACM, v.22 n.8, p.455-460, Aug. 1979
	Andreas Stolcke, An efficient probabilistic context-free parsing algorithm that computes prefix probabilities, Computational Linguistics, v.21 n.2, p.165-201, June 1995
	Anna Corazza , Renato De Mori , Roberto Gretter , Giorgio Satta, Optimal Probabilistic Evaluation Functions for Search Controlled by Stochastic Context-Free Grammars, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.16 n.10, p.1018-1027, October 1994
	Richard M. King, Research on synthesis of concurrent computing systems (Extended Abstract), ACM SIGARCH Computer Architecture News, v.11 n.3, p.39-46, June 1983
	Thomas J. Pennello , Frank DeRemer, Efficient computation of LALR(1) look-ahead sets, ACM SIGPLAN Notices, v.39 n.4, April 2004
	Alex de V. Garcia , Edward Hermann Haeusler, Code migration and program maintainability---a categorical perspective, Information Processing Letters, v.79 n.5, p.249-254, September 15, 2001
	Eric Wehrli, The IPS system, Proceedings of the 14th conference on Computational linguistics, August 23-28, 1992, Nantes, France
	Sylvie Billot , Bernard Lang, The structure of shared forests in ambiguous parsing, Proceedings of the 27th annual meeting on Association for Computational Linguistics, p.143-151, June 26-29, 1989, Vancouver, British Columbia, Canada
	Mori Rimon , Jacky Herz, The recognition capacity of local syntactic constraints, Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics, p.155-160, April 09-11, 1991, Berlin, Germany
	Bernard Lang, Parsing incomplete sentences, Proceedings of the 12th conference on Computational linguistics, p.365-371, August 22-27, 1988, Budapest, Hungry
	E. Steegmans , J. Lewi , I. Van Horebeek, Generation of Interactive Parsers with Error Handling, IEEE Transactions on Software Engineering, v.18 n.5, p.357-367, May 1992
	Lin-Shan Lee , Long-Ji Lin , K. J. Chen , Lee-Feng Chien , James Huang, An efficient natural language processing system specially designed for the Chinese language, Computational Linguistics, v.17 n.4, p.347-374, December 1991
	Jaroslav Král , Michal Žemlička, Software confederations: an architecture for global systems and global management, Managing globally with information technology, Idea Group Publishing, Hershey, PA, 2003
	Richard St-Denis, Designing reactive systems: integration of abstraction techniques into a synthesis procedure, Journal of Systems and Software, v.60 n.2, p.103-112, 1 February 2002
	Mark Johnson , Brian Roark, Compact non-left-recursive grammars using the selective left-corner transform and factoring, Proceedings of the 18th conference on Computational linguistics, p.355-361, July 31-August 04, 2000, Saarbrücken, Germany
	Barry K. Rosen, A Church-Rosser theorem for graph grammars, ACM SIGACT News, v.7 n.3, p.26-31, Summer 1975
	R. A. Sharman, Syllable-based phonetic transcription by maximum likelihood methods, Proceedings of the 15th conference on Computational linguistics, August 05-09, 1994, Kyoto, Japan
	Dilip Sarkar , Narsingh Deo, Estimating the Speedup in Parallel Parsing, IEEE Transactions on Software Engineering, v.16 n.7, p.677-683, July 1990
	Massimo Marino, Bottom-up parsing extending context-freeness in a Process Grammar processor, Proceedings of the 28th annual meeting on Association for Computational Linguistics, p.299-306, June 06-09, 1990, Pittsburgh, Pennsylvania
	Jonathan Calder, Paradigmatic morphology, Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics, p.58-65, April 10-12, 1989, Manchester, England
	Marjorie Templeton , John Burger, Problems in natural-language interface to DBMS with examples from EUFID, Proceedings of the first conference on Applied natural language processing, February 01-03, 1983, Santa Monica, California
	Philip J. Hayes , George V. Mouradian, Flexible parsing, Computational Linguistics, v.7 n.4, p.232-242, October-December 1981
	Marc Dymetman, A generalized Greibach Normal Form for definite clause grammars, Proceedings of the 14th conference on Computational linguistics, August 23-28, 1992, Nantes, France
	Masaru Tomita, LR parsers for natural languages, Proceedings of the 22nd annual meeting on Association for Computational Linguistics, p.354-357, July 02-06, 1984, Stanford, California
	Ted Briscoe, Deterministic parsing and unbounded dependencies, Proceedings of the third conference on European chapter of the Association for Computational Linguistics, p.211-217, April 01-03, 1987, Copenhagen, Denmark
	Ernst Leiss, Constructing a finite automaton for a given regular expression, ACM SIGACT News, v.12 n.3, Fall 1980
	A. Bossi , N. Cocco , S. Dulli, Modular decomposition of Ada into a hierarchy of sublanguages, ACM SIGAda Ada Letters, v.II n.6, p.53-58, May/June 1983
	Eric Wehrli, The IPS system, Proceedings of the 14th conference on Computational linguistics, August 23-28, 1992, Nantes, France
	Graeme Ritchie, Completeness conditions for mixed strategy bidirectional parsing, Computational Linguistics, v.25 n.4, p.457-486, December 1999
	On parsing LL-languages, Theoretical Computer Science, v.267 n.1-2, p.49-59, 09/26/2001
	David D. McDonald, An efficient chart-based algorithm for partial-parsing of unrestricted texts, Proceedings of the third conference on Applied natural language processing, March 31-April 03, 1992, Trento, Italy
	Jason Eisner , Giorgio Satta, Efficient parsing for bilexical context-free grammars and head automaton grammars, Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics, p.457-464, June 20-26, 1999, College Park, Maryland
	Steven Abney , David McAllester , Fernando Pereira, Relating probabilistic grammars and automata, Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics, p.542-549, June 20-26, 1999, College Park, Maryland
	Jacques Farré , J. Fortes Gálvez, Bounded-connect noncanonical discriminating-reverse parsers, Theoretical Computer Science, v.313 n.1, p.73-91, 16 February 2004
	Kôiti Hasida, A constraint-based approach to linguistic performance, Proceedings of the 13th conference on Computational linguistics, p.149-154, August 20-25, 1990, Helsinki, Finland
	Masaru Tomita , Jaime G. Carbonell, Another stride towards knowledge-based machine translation, Proceedings of the 11th coference on Computational linguistics, August 25-29, 1986, Bonn, Germany
	Mark S. Sherman , Martha S. Borkan, A flexible semantic analyzer for Ada, ACM SIGPLAN Notices, v.15 n.11, November 1980
	Hans Haugeneder , Manfred Gehrke, A user friendly ATN Programming Environment (APE), Proceedings of the 11th coference on Computational linguistics, August 25-29, 1986, Bonn, Germany
	Jonathan Slocum, A practical comparison of parsing strategies, Proceedings of the 19th annual meeting on Association for Computational Linguistics, June 29-July 01, 1981, Stanford, California
	Philippe Blache , Jean-Yves Morin, Bottom-Up Filtering: a parsing strategy for GPSG, Proceedings of the 13th conference on Computational linguistics, p.19-23, August 20-25, 1990, Helsinki, Finland
	Monique Snoeck , Guido Dedene, Existence Dependency: The Key to Semantic Integrity Between Structural and Behavioral Aspects of Object Types, IEEE Transactions on Software Engineering, v.24 n.4, p.233-251, April 1998
	Gary L. Filipski , Donald R. Moore , John E. Newton, Ada as a software transition tool, Proceedings of the ACM-SIGPLAN symposium on The ADA programming language, p.176-182, January 1980
	Thomas Hanneforth , Silvan Heintze , Manfred Stede, Rhetorical parsing with underspecification and forests, Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology: companion volume of the Proceedings of HLT-NAACL 2003--short papers, p.31-33, May 27-June 01, 2003, Edmonton, Canada
	Massimo Marino, A process-activation based parsing algorithm for the development of Natural Language Grammars, Proceedings of the 12th conference on Computational linguistics, p.390-395, August 22-27, 1988, Budapest, Hungry
	Eduardus A. T. Merks , J. Michael Dyck , Robert D. Cameron, Language Design for Program Manipulation, IEEE Transactions on Software Engineering, v.18 n.1, p.19-32, January 1992
	Anna Corazza , Renato De Mori , Roberto Gretter , Giorgio Satta, Computation of Probabilities for an Island-Driven Parser, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.13 n.9, p.936-950, September 1991
	Martin Plátek, Composition of translation schemes with D-trees, Proceedings of the 9th conference on Computational linguistics, p.313-318, July 05-10, 1982, Prague, Czechoslovakia
	Yuri A. Ivanov , Aaron F. Bobick, Recognition of Visual Activities and Interactions by Stochastic Parsing, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.22 n.8, p.852-872, August 2000
	D. J. Cooke, On non-hierachical systems of binary operators, ACM SIGACT News, v.15 n.3, p.36-44, Summer-Fall 1983
	James Kilbury, Parsing with Category Coocurrence Restrictions, Proceedings of the 12th conference on Computational linguistics, p.324-327, August 22-27, 1988, Budapest, Hungry
	Laura Proctor, Review of "Computer processing of natural language" by Gilbert K. Krulee. Prentice Hall 1991: and "Computers and human language" by George W. Smith. Oxford University Press 1991., Computational Linguistics, v.17 n.4, December 1991
	Hiroaki Numazaki , Hozumi Tanaka, A new parallel algorithm for generalized LR parsing, Proceedings of the 13th conference on Computational linguistics, p.305-310, August 20-25, 1990, Helsinki, Finland
	Peter Norvig, Techniques for automatic memoization with applications to context-free parsing, Computational Linguistics, v.17 n.1, March 1991
	Robert C. Berwick , Amy S. Weinberg, Syntactic constraints and efficient parsability, Proceedings of the 21st annual meeting on Association for Computational Linguistics, June 15-17, 1983, Cambridge, Massachusetts
	Tetsuo Saitou , Mitsugu Suzuki , Tan Watanabe, Dominance analysis of irreducible CFGs by reduction, ACM SIGPLAN Notices, v.40 n.4, April 2005
	K. W. Kennedy, Node listings applied to data flow analysis, Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.10-21, January 20-22, 1975, Palo Alto, California
	René Leermakers, Non-deterministic recursive ascent parsing, Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics, p.63-68, April 09-11, 1991, Berlin, Germany
	Alan J. Demers, Generalized left corner parsing, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.170-182, January 17-19, 1977, Los Angeles, California
	Jukka Paakki , Jussi Koskinen , Airi Salminen, From relational program dependencies to hypertextual access structures, Nordic Journal of Computing, v.4 n.1, p.3-36, Spring 1997
	Pavel Smrž , Vladimír Kadlec, Incremental parser for Czech, Proceedings of the 4th international symposium on Information and communication technologies, January 03-06, 2005, Cape Town, South Africa
	Jin Guo, Critical tokenization and its properties, Computational Linguistics, v.23 n.4, p.569-596, December 1997
	Robert C. Berwick, Bounded context parsing and easy learnability, Proceedings of the 22nd annual meeting on Association for Computational Linguistics, p.20-23, July 02-06, 1984, Stanford, California
	Paul Klint , Ralf Lämmel , Chris Verhoef, Toward an engineering discipline for grammarware, ACM Transactions on Software Engineering and Methodology (TOSEM), v.14 n.3, p.331-380, July 2005
	Paola Merlo, An LR category-neutral parser with left corner prediction, Proceedings of the 30th annual meeting on Association for Computational Linguistics, June 28-July 02, 1992, Newark, Delaware
	Shana Watters , Tim Miller , Praveen Balachandran , William Schuler , Richard Voyles, Exploiting a sensed environment to improve human-agent communication, Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, July 25-29, 2005, The Netherlands
	Janusz Jurek, Recent developments of the syntactic pattern recognition model based on quasi-context sensitive languages, Pattern Recognition Letters, v.26 n.7, p.1011-1018, 15 May 2005
	Hirosi Tuda , Kôiti Hasida , Hidetosi Sirai, JPSG parser on constraint logic programming, Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics, p.95-102, April 10-12, 1989, Manchester, England
	Mark-Jan Nederhof, Weighted deductive parsing and Knuth's algorithm, Computational Linguistics, v.29 n.1, p.135-143, March 2003
	Yasubumi Sakakibara, Grammatical Inference in Bioinformatics, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.27 n.7, p.1051-1062, July 2005
	Oliviero Stock, Parsing with flexibility, dynamic strategies, and idioms in mind, Computational Linguistics, v.15 n.1, p.1-18, March 1989
	Mark-Jan Nederhof, Approximating context-free by rational transduction for example-based MT, Proceedings of the workshop on Data-driven methods in machine translation, p.1-8, July 07-07, 2001, Toulouse, France
	René Krenz , Elena Dubrova, Improved Boolean function hashing based on multiple-vertex dominators, Proceedings of the 2005 conference on Asia South Pacific design automation, January 18-21, 2005, Shanghai, China
	Y.-C. Cheng , S.-Y. Lu, The Binary Consistency Checking Scheme and Its Applications to Seismic Horizon Detection, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.11 n.4, p.439-447, April 1989
	Mark-Jan Nederhof , Giorgio Satta, The language intersection problem for non-recursive context-free grammars, Information and Computation, v.192 n.2, p.172-184, August 1, 2004
	Rafael Corchuelo , José A. Pérez, , Antonio Ruiz , Miguel Toro, Repairing syntax errors in LR parsers, ACM Transactions on Programming Languages and Systems (TOPLAS), v.24 n.6, p.698-710, November 2002
	Jonathan Goldstine , Hing Leung , Detlef Wotschke, Measuring nondeterminism in pushdown automata, Journal of Computer and System Sciences, v.71 n.4, p.440-466, November 2005
	Mark S. Sherman , Martha S. Borkan, A flexible semantic analyzer for Ada, Proceedings of the ACM-SIGPLAN symposium on The ADA programming language, p.62-69, January 1980
	Klaus Wich, Sublogarithmic ambiguity, Theoretical Computer Science, v.345 n.2-3, p.473-504, 22 November 2005
	Jungyun Seo , Robert F. Simmons, Syntactic graphs: a representation for the union of all ambiguous parse trees, Computational Linguistics, v.15 n.1, p.19-32, March 1989
	Oscar H. Ibarra , Ting-Chuen Pong , Stephen M. Sohn, Parallel Recognition and Parsing on the Hypercube, IEEE Transactions on Computers, v.40 n.6, p.764-770, June 1991
	Masaru Tomita, An efficient augmented-context-free parsing algorithm, Computational Linguistics, v.13 n.1-2, p.31-46, January-June 1987
	Susan L. Graham , Mark Wegman, A fast and usually linear algorithm for global flow analysis, Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.22-34, January 20-22, 1975, Palo Alto, California
	Ken Kennedy , Linda Zucconi, Applications of a graph grammar for program control flow analysis, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.72-85, January 17-19, 1977, Los Angeles, California
	Ken Kennedy , Linda Zucconi, Applications of a graph grammar for program control flow analysis, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.72-85, January 17-19, 1977, Los Angeles, California
	Harry Bunt , John Carroll , Giorgio Satta, Development in parsing technology: from theory to application, New developments in parsing technology, Kluwer Academic Publishers, Norwell, MA, 2004
	Mark Green, A survey of three dialogue models, ACM Transactions on Graphics (TOG), v.5 n.3, p.244-275, July 1986
	Stepehn S. Yau , Wonmo Hong, Verification of Concurrent Control Flow in Distributed Computer Systems, IEEE Transactions on Software Engineering, v.14 n.4, p.405-417, April 1988
	On parsing and condensing substrings of LR languages in linear time, Theoretical Computer Science, v.267 n.1-2, p.61-82, 09/26/2001
	Haiming Chen , Yunmei Dong, Yet another meta-language for programming language processing, ACM SIGPLAN Notices, v.37 n.6, June 2002
	M. Anicona , G. Dodero , V. Gianuzzi , M. Morgavi, Efficient construction of LR(k) states and tables, ACM Transactions on Programming Languages and Systems (TOPLAS), v.13 n.1, p.150-178, Jan. 1991
	Yuk Wah Wong , Raymond J. Mooney, Learning for semantic parsing with statistical machine translation, Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, p.439-446, June 04-09, 2006, New York, New York
	Mark-Jan Nederhof, A General Technique to Train Language Models on Language Models, Computational Linguistics, v.31 n.2, p.173-186, June 2005
	Jean Utke , Andrew Lyons , Uwe Naumann, Efficient reversal of the intraprocedural flow of control in adjoint computations, Journal of Systems and Software, v.79 n.9, p.1280-1294, September 2006
	Elizabeth Scott , Adrian Johnstone, Right nulled GLR parsers, ACM Transactions on Programming Languages and Systems (TOPLAS), v.28 n.4, p.577-618, July 2006
	Alpana Dubey, Goodness criteria for programming language grammar rules, ACM SIGPLAN Notices, v.41 n.12, December 2006
	Mark-Jan Nederhof , Giorgio Satta, Probabilistic parsing strategies, Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics, p.542-es, July 21-26, 2004, Barcelona, Spain
	A. Ron Oliver , Neil D. Jones, Program control via transition matrices: a novel application of micro-programming, ACM SIGMICRO Newsletter, v.7 n.1, p.8-27, March 1976
	Stephan Kanthak , Hermann Ney, FSA: an efficient and flexible C++ toolkit for finite state automata using on-demand computation, Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics, p.510-es, July 21-26, 2004, Barcelona, Spain
	Hao Zhang , Liang Huang , Daniel Gildea , Kevin Knight, Synchronous binarization for machine translation, Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, p.256-263, June 04-09, 2006, New York, New York
	Giorgio Satta , Enoch Peserico, Some computational complexity results for synchronous context-free grammars, Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing, p.803-810, October 06-08, 2005, Vancouver, British Columbia, Canada
	Tim Miller , Andy Exley , William Schuler, Elements of a spoken language programming interface for robots, Proceeding of the ACM/IEEE international conference on Human-robot interaction, March 10-12, 2007, Arlington, Virginia, USA
	Maxim Teslenko , Elena Dubrova, An Efficient Algorithm for Finding Double-Vertex Dominators in Circuit Graphs, Proceedings of the conference on Design, Automation and Test in Europe, p.406-411, March 07-11, 2005
	A V Moura, Early error detection in syntax-driven parsers, IBM Journal of Research and Development, v.30 n.6, p.617-626, Nov. 1986