Characterizing unambiguous precedence systems in expressions without superfluous parentheses

DOI10.1080/00207160802166499MaRDI QIDQ3603581zbMATH OpenOpenAlexFDO

Authors 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 languagesinfix notationprecedence ordersuperfluous parenthesesunambiguous grammars

Mathematics Subject Classification ID

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

Recommendations

• Distinguishing redundant parentheses by syntax
• Precedences in specifications and implementations of programming languages
• Infix and postfix notations
• On some properties of reverse Polish notation
• Beyond operator-precedence grammars and languages

Cites work

• A mathematical introduction to logic.
• Distinguishing redundant parentheses by syntax
• scientific article; zbMATH DE number 3905825 (Why is no real title available?)

Cited in

(2)

• Distinguishing redundant parentheses by syntax
• On the 'correct prefix property' in precedence parsers

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

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