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)
68Q45: Formal languages and automata
68N20: Theory of compilers and interpreters
68Q42: Grammars and rewriting systems
Related Items
Membership for growing context-sensitive grammars is polynomial, An algebraic structure for derivations in rewriting systems, Efficient parsing algorithms for general context-free parsers, The derivation language of a phrase structure grammar, Algebraic properties of derivation words, The ancestor width of grammars and languages, Growing context-sensitive languages and Church-Rosser languages, Lower bound technique for length-reducing automata, The relation between derivations and syntactical structures in phrase- structure grammars, On a code problem concerning planar acyclic graphs, Notes on canonical label languages, Enumerating syntactical graphs and lattices of derivations