Common
Operator-precedence parser
Bottom-up parser that interprets an operator-precedence grammar
Operator-precedence parser
In computer science, an operator-precedence parser is a bottom-up parser that interprets an operator-precedence grammar. For example, most calculators 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.
Open boosters, collect cards and trade them. Free to play.
Play for free