Live briefing
Everything about Operator-precedence parser
Bottom-up parser that interprets an operator-precedence grammar
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). Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Operator-precedence parserA 5-minute orientation
- Pick up a classic book: Introduction to automata theory, languages, and computationThe most-reprinted book on the subject
- Read the landmark paper: An Operator Precedence Parser for Standard Prolog TextCited 9 times
- Go sideways: Shunting yard algorithmA closely related topic
- Go sideways: ParsingA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
đź“š Books worth reading
Introduction to automata theory, languages, and computationJohn E. Hopcroft, Jeffrey D. Ullman · 1979
Principles of compiler designAlfred V. Aho, Jeffrey D. Ullman · 1977
Software Language EngineeringKrzysztof Czarnecki · 2013
Introduction to compiler constructionParsons, Thomas W. · 1992
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Shunting yard algorithm In computer science, the shunting yard algorithm is a method for parsing arithmetical or logical expressions, or a combination of both, specified in infix…
- Parsing Parsing, syntax analysis, or syntactic analysis is a process of analyzing a string of symbols, either in natural language, computer languages or data structures…
- Tail recursive parser In computer science, tail recursive parsers are a derivation from the more common recursive descent parsers. Tail recursive parsers are commonly used to…
- Recursive descent parser In computer science, a recursive descent parser is a kind of top-down parser built from a set of mutually recursive procedures (or a non-recursive equivalent)…
- Shift-reduce parser A shift-reduce parser is a class of efficient, table-driven bottom-up parsing methods for computer languages and other notations formally defined by a…
- Parsing expression grammar In computer science, a parsing expression grammar (PEG) is a type of analytic formal grammar, i.e. it describes a formal language in terms of a set of…
- Re2c re2c is a free and open-source lexer generator for C, C++, D, Go, Haskell, Java, JavaScript, OCaml, Python, Rust, V and Zig. It compiles declarative regular…
- M-expression In the Lisp programming language, M-expressions (or meta-expressions) were an early proposed syntax for Lisp, inspired by contemporary languages such as…