A note on enumerable grammars
Reads0
Chats0
TLDR
The recursiveness of languages generated by ω-regular grammars is proved and the concept of a generalized grammar with an enumerable set of productions is introduced.Abstract:
A concept of a generalized grammar with an enumerable set of productions is introduced. Some of the generalized grammars, called “ω-regular grammars”, are considered. The recursiveness of languages generated by ω-regular grammars is proved.read more
Citations
More filters
Proceedings ArticleDOI
Total parser combinators
TL;DR: A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described.
Journal ArticleDOI
Computability and Unsolvability.
Louis O. Kattsoff,Martin Davis +1 more
TL;DR: Only for you today!
Journal ArticleDOI
Grammars with structured vocabulary: A model for the algol-68 definition
TL;DR: A length-nondecreasing restriction on vW[p]g is given, and it is shown that being a representation language of a vW [ p]g satisfying that restriction is characteristic of the A-free context-sensitive languages.
Proceedings ArticleDOI
Some restrictions on W-grammars
TL;DR: The effect of some restrictions on W-grammars (the formalization of the syntax of ALGOL 68) are explored and WRB is closed under nested iterated substitution and is properly contained in the family of indexed languages.
Journal ArticleDOI
Some restrictions on W -grammars.
TL;DR: The effect of some restrictions on W-grammars (the fonnalization of the syntax ofalgol 68) are explored and two incomparable families examined at length are Wrb andWs.