Editing Operator-precedence parser (section)

{{Short description|Bottom-up parser that interprets an operator-precedence grammar}}
In [[computer science]], an '''operator-precedence parser''' is a [[Bottom-up parsing|bottom-up parser]] that interprets an [[operator-precedence grammar]]. For example, most [[calculator]]s use operator-precedence parsers to convert from the human-readable [[infix notation]] relying on [[order of operations]] to a format that is optimized for evaluation such as [[Reverse Polish notation]] (RPN).

[[Edsger Dijkstra]]'s [[shunting yard algorithm]] is commonly used to implement operator-precedence parsers.