Toward a theory of input-driven locally parsable languages

DOI10.1016/J.TCS.2016.05.003zbMath1355.68154OpenAlexW2346977452MaRDI QIDQ728273

Stefano Crespi Reghizzi, Matteo Pradella, Dino Mandrioli, Violetta Lonati

Publication date: 19 December 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.05.003

zbMATH Keywords

visibly pushdown languagesparallel parsinginput-driven languagesoperator precedence languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Beyond operator-precedence grammars and languages ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• NTS languages are deterministic and congruential
• McNaughton families of languages.
• Operator precedence and the visibly pushdown property
• Parallel parsing of operator precedence grammars
• Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization
• Tinput-Driven Pushdown Automata
• Locally Chain-Parsable Languages
• Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages
• Adding nesting structure to words
• PAC-Learning Unambiguous k,l-NTS ≤  Languages
• Synchronization of Pushdown Automata
• First-Order and Temporal Logics for Nested Words
• Church-Rosser Thue systems and formal languages
• Algebraic properties of operator precedence languages
• Syntactic Analysis and Operator Precedence
• Parenthesis Grammars
• The use of grammatical inference for designing programming languages
• Bounded context syntactic analysis
• Regular Languages Are Church-Rosser Congruential

This page was built for publication: Toward a theory of input-driven locally parsable languages