Algebraic properties of operator precedence languages

DOI10.1016/S0019-9958(78)90474-6MaRDI QIDQ4155847zbMATH OpenWikidataFDO

Authors Stefano Crespi Reghizzi, Dino Mandrioli, David Martin

Publication date 1978

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(78)90474-6

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(15)

• Generalizing input-driven languages: theoretical and practical benefits
• Operator precedence and the visibly pushdown property
• Weighted operator precedence languages
• Beyond operator-precedence grammars and languages
• Operator precedence temporal logic and model checking
• Operator precedence languages: their automata-theoretic and logic characterization
• Precedence automata and languages
• First-order logic definability of free languages
• Temporal logic and model checking for operator precedence languages
• Higher-order operator precedence languages
• A first-order complete temporal logic for structured context-free languages
• Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
• Cyclic operator precedence grammars for parallel parsing
• Cyclic operator precedence grammars for improved parallel parsing
• Toward a theory of input-driven locally parsable languages

This page was built for publication: Algebraic properties of operator precedence languages

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