A Syntax-Analysis Procedure for Unambiguous Context-Free Grammars

No abstract is available for this paper.

• Publication year

  1969

• Venue

  Journal of the ACM

• Publication date

  1969-07-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/321526.321531
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Recognition and Parsing of Context-Free Languages in Time n^3

  1967cited by this paper
• Readings in Automatic Language Processing

  1966cited by this paper
• The mathematical theory of context free languages

  1966cited by this paper
• On the relative efficiencies of context-free grammar

  1965cited by this paper
• An Efficient Recognition and Syntax-Analysis Algorithm for Context-Free Languages

  1965cited by this paper
• Journal of the Association for Computing Machinery

  1961cited by this paper
• On Certain Formal Properties of Grammars

  1959cited by this paper

• Earley table traversing parsers

  2025cites this paper
• Fence - A Context-free Grammar Parser with Constraints for Model-driven Language Specification

  2018cites this paper
• GenTree A Tool For Analysis Of Syntactic Algorithms Based On Younger Cocke

  2017cites this paper
• Linear-space recognition for grammars with contexts

  2017cites this paper
• An extension of context-free grammars with one-sided context specifications

  2014influential citation
• Conjunctive Context-Free Path Queries

  2014cites this paper
• Conjunctive and Boolean grammars: The true general case of the context-free grammars

  2013cites this paper
• Defining Contexts in Context-Free Grammars

  2012cites this paper
• Fencing the Lamb: A Chart Parser for ModelCC

  2012cites this paper
• Reestimation of Reified Rules in Semiring Parsing and Biparsing

  2011cites this paper
• A Constraint-Satisfaction Parser for Context-Free Grammars

  2011cites this paper
• A Language Specification Tool for Model-Based Parsing

  2011cites this paper
• Proceedings of the Fifth Workshop on Syntax, Semantics and Structure in Statistical Translation

  2011cites this paper
• Fence - An Efficient Parser with Ambiguity Support for Model-Driven Language Specification

  2011cites this paper
• A syntactic approach based on distortion-tolerant Adjacency Grammars and a spatial-directed parser to interpret sketched diagrams

  2010cites this paper
• Unambiguous Boolean grammars

  2008cites this paper
• Software and Data Technologies

  2008cites this paper
• Generalized ID/LP grammar: a formalism for parsing linearization-based HPSG grammars

  2008cites this paper
• Faster Scannerless GLR Parsing

  2008cites this paper
• TOWARDS SIMPLER TREE SUBSTITUTION GRAMMARS

  2007cites this paper
• Generalised LR parsing algorithms

  2006cites this paper
• Improving the E ffi ciency of Parsing Discontinuous Constituents

  2003cites this paper
• Improving the Eciency of Parsing with Discontinuous Constituents

  2002cites this paper
• Foundations of Computational Linguistics

  2001cites this paper
• Compound Noun Segmentation Based on Lexical Data Extracted from Corpus

  2000cites this paper
• Foundations of Computational Linguistics

  1999cites this paper
• A survey of visual language specification and recognition

  1998cites this paper
• The CYK approach to serial and parallel parsing

  1990cites this paper
• Computation of Language

  1989cites this paper
• Computation of language - an essay on syntax, semantics and pragmatics in natural man-machine communication

  1989cites this paper
• Semi-Applicative Programming. Examples of Context Free Recognizers.

  1986cites this paper
• Inherent Ambiguities in Families of Grammars (Extended Abstract)

  1979cites this paper
• Dynamic programming in computer science

  1979cites this paper
• Parsing of General Context-Free Languages

  1976cites this paper
• Relationships between pushdown automata with counters and complexity classes

  1975cites this paper
• Theory of formal grammars

  1974cites this paper
• Tabulator-Turingmaschine und Komplexität

  1971cites this paper
• An efficient context-free parsing algorithm

  1970cites this paper
• An efficient context-free parsing algorithm

  1970cites this paper
• Towards Simpler Tree Substitution Grammars Msc in Logic

  year unknowncites this paper
• Semi-Applicative Programming : r Examples of Context Free

  year unknowncites this paper