Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Operator precedence grammars, introduced by Floyd several decades ago, enjoy properties that make them very attractive to face… Expand
  • figure 1
2012
2012
In almost all language processing applications, languages are parsed employing classical algorithms (such as the LR(1) parsers… Expand
  • figure 1
  • figure 2
  • figure 4
2010
2010
Operator precedence languages, designated as Floyd's Languages (FL) to honor their inventor, are a classical deterministic… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
2008
2008
A wide range of parser generators are used to generate parsers for programming languages. The grammar formalisms that come with… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
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… Expand
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… Expand
  • figure 1
  • figure 2
1996
1996
Prolog is a language with a dynamic grammar which is the result of embedded operator declarations. The parsing of such a language… Expand
Highly Cited
1995
Highly Cited
1995
This paper investigates graph rewriting as a tool for high-level recognition of two-dimensional mathematical notation. "High… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
1982
1982
  • M. Kaul
  • Graph-Grammars and Their Application to Computer…
  • 1982
  • Corpus ID: 30286924
The parsing problem for graphs is to transform a given input graph into a parse tree, which represents the layered hierarchical… Expand
1973
1973
There is little agreement on the extent to which syntax should be a consideration in the design and implementation of programming… Expand