Recursive ascent parser

Known as: Recursive ascent 
In computer science, recursive ascent parsing is a technique for implementing an LALR parser which uses mutually-recursive functions rather than… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1988-2003
01219882003

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2003
2003
The parsing problem is ubiquitous in Computer Science. Perhaps that is part of the reason it has been used so frequently to… (More)
  • figure 5
  • figure 4
  • figure 8
Is this relevant?
1993
1993
Generalized left-corner parsing was originally presented as a technique for generating a parser for the SLR(1) class of grammars… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Review
1992
Review
1992
Leermakers, R., Recursive ascent parsing: from Earley to Marcus, Theoretical Computer Science 104 (1992) 299-3 12. An overview is… (More)
Is this relevant?
1992
1992
 
Is this relevant?
1991
1991
A purely functional implementation of LR-parsers is given, together with a simple correctness proof. It is presented as a… (More)
Is this relevant?
1990
1990
Consider an invocation of a state with items a k -4 '4 • a f3k . These items indicate that a shift action for a may be performed… (More)
Is this relevant?
1989
1989
Pennello [4] introduced the idea of compiled LR parsers by representing each row of the LR parsing table as a block of code. Both… (More)
Is this relevant?
1988
1988
The usual implementation of a parser for an LL grammar is a recursive descent parser, a set of mutually recursive procedures, one… (More)
Is this relevant?
1988
1988
 
Is this relevant?