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.
2018
2018
Propositional calculus is a method used to calculate the value of the truth of a propositional. Propositional calculus has been… 
2007
2007
Dynamic operator declarations were introduced in the first Prolog system in the early 1970s. Today several other logical and… 
2006
2006
In order to resolve the problem of low accuracy in Chinese natural language parsing introduced by the lack of complete grammar… 
Review
2002
Review
2002
In the practice of professional engineering design, nearly all work is ultimately completed in a team format and under a deadline… 
1996
1996
Prolog is a language with a dynamic grammar which is the result of embedded operator declarations. The parsing of such a language… 
1982
1982
  • M. Er
  • 1982
  • Corpus ID: 62620555
An algorithm for computing the precedence functions of a given precedence matrix is presented. This algorithm is based on the… 
1979
1979
The bottom-up syntax analysis algorithm of chapter 3 handles a subset of programming language arithmetic expressions using a… 
1976
1976
Over the last four years a new Computer Science major program has been introduced into the curriculum of the School of… 
1973
1973
We consider methods by which a precedence matrix may be modified without severely degrading the error-detecting capability of a… 
Review
1971
Review
1971
The structure of a good syntax is derived from the requirement to understand and therefore to analyse a language easily. Every…