Operator-precedence parser

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

Topic mentions per year

Topic mentions per year

1964-2018
024619642018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The increasing use of multicore processors has deeply transformed computing paradigms and applications. The wide availability of… (More)
  • figure 1
Is this relevant?
2013
2013
Operator precedence grammars, introduced by Floyd several decades ago, enjoy properties that make them very attractive to face… (More)
  • figure 1
Is this relevant?
2013
2013
In this paper we present an approach to specifying operator precedence based on declarative disambiguation constructs and an… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
2013
2013
Recent literature extended the analysis of ω-languages from the regular ones to various classes of languages with “visible syntax… (More)
  • figure 1
  • figure 2
Is this relevant?
2012
2012
In almost all language processing applications, languages are parsed employing classical algorithms (such as the LR(1) parsers… (More)
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
2010
2010
Operator precedence languages, designated as Floyd’s Languages (FL) to honor their inventor, are a classical deterministic… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2008
2008
A wide range of parser generators are used to generate parsers for programming languages. The grammar formalisms that come with… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2007
2007
machine The parser output is the input of the abstract machine, which outputs the expression value. For example, L{a=*(+(2,2),1… (More)
  • table I
  • table II
  • figure 1
  • table IV
  • table V
Is this relevant?
1981
1981
A simple linear time and space algorithm that transforms a standardized tree representation of an arithmetic expression lacking… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1973
1973
A general theory of canonical precedence analysis is defined and studied. The familiar types of precedence analysis such as… (More)
  • figure 1
  • figure 3
  • figure 4
Is this relevant?