Operator precedence and the visibly pushdown property

DOI10.1016/j.jcss.2011.12.006zbMath1250.68175OpenAlexW1990098488WikidataQ57318715 ScholiaQ57318715MaRDI QIDQ1757840

Dino Mandrioli, Stefano Crespi Reghizzi

Publication date: 6 November 2012

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2011.12.006

zbMATH Keywords

pushdown automatabalanced languagesclosure under language operationsheight deterministic languagesoperator precedence grammarsparenthesis languagesXML languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)

Related Items (22)

Model-checking structured context-free languages ⋮ Colored nested words ⋮ First-Order Logic Definability of Free Languages ⋮ On the power of pushing or stationary moves for input-driven pushdown automata ⋮ Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization ⋮ Tinput-Driven Pushdown Automata ⋮ Locally Chain-Parsable Languages ⋮ Beyond operator-precedence grammars and languages ⋮ Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages ⋮ Sweeping input-driven pushdown automata ⋮ When input-driven pushdown automata meet reversiblity ⋮ Generalizing input-driven languages: theoretical and practical benefits ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Operator precedence temporal logic and model checking ⋮ On the power of pushing or stationary moves for input-driven pushdown automata ⋮ Toward a theory of input-driven locally parsable languages ⋮ Unnamed Item ⋮ Weighted operator precedence languages ⋮ Weighted Operator Precedence Languages ⋮ Deterministic input-driven queue automata: finite turns, decidability, and closure properties ⋮ Digging input-driven pushdown automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Boolean grammars
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Precedence Automata and Languages
• Adding nesting structure to words
• Synchronization of Grammars
• On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
• Height-Deterministic Pushdown Automata
• Operator Precedence and the Visibly Pushdown Property
• Visibly pushdown languages
• Synchronization of Pushdown Automata
• Towards a Taxonomy for ECFG and RRPG Parsing
• Operator Precedence Grammars and the Noncounting Property
• Algebraic properties of operator precedence languages
• Noncounting Context-Free Languages
• Syntactic Analysis and Operator Precedence
• Parsing Techniques
• Some properties of precedence languages
• Parenthesis Grammars
• A characterization of parenthesis languages
• The use of grammatical inference for designing programming languages

This page was built for publication: Operator precedence and the visibly pushdown property