Skip to search formSkip to main contentSkip to account menu

Operator-precedence parser

Known as: Operator precedence parser, Precedence parser 
In computer science, an operator precedence parser is a bottom-up parser that interprets an operator-precedence grammar. For example, most… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2012
2012
In almost all language processing applications, languages are parsed employing classical algorithms (such as the LR(1) parsers… 
2010
2010
Operator precedence languages, designated as Floyd's Languages (FL) to honor their inventor, are a classical deterministic… 
2007
2007
  • E. Favero
  • Softw. Pract. Exp.
  • 2007
  • Corpus ID: 11694236
Dynamic operator declarations were introduced in the first Prolog system in the early 1970s. Today several other logical and… 
2007
2007
  • R. Berger
  • Comput. Stat. Data Anal.
  • 2007
  • Corpus ID: 40258579
Highly Cited
2000
Highly Cited
2000
  • J. Pane, B. Myers
  • Proceeding IEEE International Symposium on…
  • 2000
  • Corpus ID: 9865926
The accurate formulation of boolean expressions is a notorious problem in programming languages and database query tools. This… 
1996
1996
Prolog is a language with a dynamic grammar which is the result of embedded operator declarations. The parsing of such a language… 
Highly Cited
1995
Highly Cited
1995
This paper investigates graph rewriting as a tool for high-level recognition of two-dimensional mathematical notation. "High… 
1973
1973
There is little agreement on the extent to which syntax should be a consideration in the design and implementation of programming…