The parsing for general phrase-structure grammars
From MaRDI portal
Publication:5607230
DOI10.1016/S0019-9958(70)90224-XzbMath0207.01601MaRDI QIDQ5607230
Publication date: 1970
Published in: Information and Control (Search for Journal in Brave)
Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)
Related Items
Lower bound technique for length-reducing automata ⋮ An algebraic structure for derivations in rewriting systems ⋮ Growing context-sensitive languages and Church-Rosser languages ⋮ Efficient parsing algorithms for general context-free parsers ⋮ The derivation language of a phrase structure grammar ⋮ Notes on canonical label languages ⋮ On a code problem concerning planar acyclic graphs ⋮ Membership for growing context-sensitive grammars is polynomial ⋮ Algebraic properties of derivation words ⋮ On growing context-sensitive languages ⋮ The ancestor width of grammars and languages ⋮ The relation between derivations and syntactical structures in phrase- structure grammars ⋮ Enumerating syntactical graphs and lattices of derivations