The parsing for general phrase-structure grammars
Reads0
Chats0
TLDR
Pushdown automata serve as a base for the description of four basic parsing techniques for general phrase-structure Grammars (Chomsky O-type grammars).Abstract:
Pushdown automata serve as a base for the description of four basic parsing techniques for general phrase-structure grammars (Chomsky O-type grammars).read more
Citations
More filters
Journal ArticleDOI
Membership for growing context-sensitive grammars is polynomial
TL;DR: The membership problem for fixed context-sensitive languages is polynomial if the right hand side of every production is strictly longer than the left hand side.
Journal ArticleDOI
Growing context-sensitive languages and Church-Rosser languages
Gerhard Buntrock,Friedrich Otto +1 more
TL;DR: The class of (generalized) Church-Rosser languages and the class of context-free languages are incomparable under set inclusion, which verifies a conjecture of Mc-Naughton et al [MNO88].
Book ChapterDOI
On Growing Context-Sensitive Languages
Gerhard Buntrock,Krzysztof Lorys +1 more
TL;DR: The variable membership problem for G CSG is shown to be NP-complete and the languages generated by GCSG form an abstract family of languages and several implications are presented.
Journal ArticleDOI
A Kleene Theorem for a Class of Planar Acyclic Graphs
TL;DR: A Kleene Theorem is proved linking these two characterizations of sets of graphs, finite automata on graphs and rational expressions that involve union, nondeterministic parallel composition, serial composition, and the iterations of these compositions.
Book
Bol processor grammars
Bernard Bell,James Kippen +1 more
TL;DR: A new version of Bol Processor, namely "BP2", has been designed to serve as a aid to rule-based composition in contemporary music.
References
More filters
Journal ArticleDOI
On certain formal properties of grammars
Noam Chomsky,Noam Chomsky +1 more
TL;DR: A sequence of restrictions that limit grammars first to Turing machines, then to two types of system from which a phrase structure description of the generated language can be drawn, and finally to finite state Markov sources are shown to be increasingly heavy.
Journal ArticleDOI
On the translation of languages from left to right
TL;DR: LR(k) grammars are defined, which are perhaps the most general ones of this type, and they provide the basis for understanding all of the special tricks which have been used in the construction of parsing algorithms for languages with simple structure, e.g. algebraic languages.
Journal ArticleDOI
Syntactic Analysis and Operator Precedence
TL;DR: Three increasingly restricted types of formal grammar are phrase structure Grammars, operator grammars and precedence grammar, which form models of mathematical and algorithmic languages which may be analyzed mechanically by a simple procedure based on a matrix representation of a relation between character pairs.
Journal ArticleDOI
EULER: a generalization of ALGOL, and its formal definition: Part II
Niklaus Wirth,Helmut Weber +1 more
TL;DR: In this section the algorithmic language EULER is described first informally and then formally by its syntax and semantics, creating a language which is simpler and yet more flexible than ALGOL 60.