Operator-precedence parser: Difference between revisions

Revision as of 10:29, 14 September 2006

Revision as of 10:31, 14 September 2006

Line 1:

An '''operator precedence parser''' is a computer program that interprets an [[operator-precedence grammar]]. For example, most [[calculator]]s use operator precedence parsers to convert from [[infix notation]] with [[order of operations]] (the usual format humans use for mathematical expressions) into a different format they use internally to compute the result.

[[Edsger Dijkstra|Dijkstra]]'s [[shunting yard algorithm]] (named after the [[classification yard|shunting yard]]) is commonly used to implement operator precedence parsers which convert from infix notation to RPN. See [[Reverse Polish notation]] for a description of this algorithm(RPN).

== Relationship to other parsers ==