Characterizing unambiguous precedence systems in expressions without superfluous parentheses

DOI10.1080/00207160802166499zbMath1158.68421OpenAlexW2032448693MaRDI QIDQ3603581

Wafik Boulos Lotfallah

Publication date: 18 February 2009

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160802166499

zbMATH Keywords

formal languagesunambiguous grammarsprecedence orderinfix notationsuperfluous parentheses

Mathematics Subject Classification ID

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

Cites Work

• Distinguishing redundant parentheses by syntax
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterizing unambiguous precedence systems in expressions without superfluous parentheses