Locally chain-parsable languages

DOI10.1007/978-3-662-48057-1_12MaRDI QIDQ2946332zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Toward a theory of input-driven locally parsable languages
• scientific article; zbMATH DE number 4135421
• Parallel parsing of operator precedence grammars
• Generalizing input-driven languages: theoretical and practical benefits
• Operator precedence languages: their automata-theoretic and logic characterization

Cites work

• Adding nesting structure to words
• Church-Rosser Thue systems and formal languages
• scientific article; zbMATH DE number 3696500 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• McNaughton families of languages.
• NTS languages are deterministic and congruential
• Operator precedence and the visibly pushdown property
• Operator precedence languages: their automata-theoretic and logic characterization
• Parallel parsing of operator precedence grammars
• Syntactic Analysis and Operator Precedence

Cited in

(2)

• scientific article; zbMATH DE number 4135421 (Why is no real title available?)
• Toward a theory of input-driven locally parsable languages

This page was built for publication: Locally chain-parsable languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946332)