Toward a theory of input-driven locally parsable languages
Reads0
Chats0
TLDR
The new class of locally chain parsable languages (LCPLs), included in the deterministic context-free language family, is defined by means of the chain-driven automaton and characterized by decidable properties of grammar derivations.About:
This article is published in Theoretical Computer Science.The article was published on 2017-01-07 and is currently open access. It has received 5 citations till now. The article focuses on the topics: Pushdown automaton & Deterministic pushdown automaton.read more
Citations
More filters
Journal ArticleDOI
Beyond operator-precedence grammars and languages
TL;DR: This work extends three relations between two terminal symbols, to assign syntax structure to words, to k-tuples of consecutive symbols, in agreement with strictly locally testable regular languages.
Journal ArticleDOI
The smallest extraction problem
Journal ArticleDOI
Higher-Order Operator Precedence Languages
TL;DR: It is shown that such languages are defined by a simple cancellation rule and it is proved that max-languages make an infinite hierarchy ordered by parameter k, and Boolean closure for each subfamily of structurally compatible HOP languages is proved.
Journal ArticleDOI
Higher-order Operator Precedence Languages.
Proceedings ArticleDOI
Regular Methods for Operator Precedence Languages
TL;DR: The antichain algorithm for OPLs was proposed in this article , which is a generalization of the celebrated Myhill-Nerode theorem for the regular languages to OPL.
References
More filters
Book
Introduction to formal language theory
TL;DR: This volume intended to serve as a text for upper undergraduate and graduate level students and special emphasis is given to the role of algebraic techniques in formal language theory through a chapter devoted to the fixed point approach to the analysis of context-free languages.
Journal ArticleDOI
Adding nesting structure to words
Rajeev Alur,P. Madhusudan +1 more
TL;DR: In this paper, the authors define nested word automata, which generalize both words and ordered trees, and allow both word and tree operations, and show that the resulting class of regular languages of nested words has all the appealing theoretical properties that the classical regular word languages enjoys: deterministic nestedword automata are as expressive as their non-deterministic counterparts; the class is closed under union, intersection, complementation, concatenation, Kleene-a, prefixes, and language homomorphisms; membership, emptiness, language equivalence are all decidable;
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
Parenthesis Grammars
TL;DR: A decision procedure is given which determines whether the languages defined by two parenthesis grammars are equal.
Journal ArticleDOI
Church-Rosser Thue systems and formal languages
TL;DR: Three ways in which formal languages can be defined by Thue systems with the Church-Rosser property are studied, and some general results about the three families of languages so determined are studied.