Locally Chain-Parsable Languages

DOI10.1007/978-3-662-48057-1_12zbMath1465.68138OpenAlexW2215782470MaRDI QIDQ2946332

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

Publication date: 16 September 2015

Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11311/964072

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

Toward a theory of input-driven locally parsable languages

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
• Adding nesting structure to words
• Church-Rosser Thue systems and formal languages
• Syntactic Analysis and Operator Precedence

This page was built for publication: Locally Chain-Parsable Languages