Recursive descent parser

Known as: Recursive-descent parser, Recursive descent parsing, Recursive descent 
In computer science, a recursive descent parser is a kind of top-down parser built from a set of mutually recursive procedures (or a non-recursive… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1970-2018
051019702018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
Two recent developments in the field of formal languages are Parsing Expression Grammar (PEG) and packrat parsing. The PEG… (More)
  • figure 2
  • figure 5
Is this relevant?
2007
2007
The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which… (More)
  • table 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
An object-oriented recursive descent parsing technique that is suitable for use in advanced programming classes where no language… (More)
Is this relevant?
1998
1998
Abs t rac t . This paper presents a construct for mapping arbitrary nonleft recursive context-free grammars into recursive… (More)
  • figure 2
  • figure 8
  • figure 4
Is this relevant?
1998
1998
rdp is a parser generator which accepts Iterator Backus Naur Form productions decorated with attributes and ANSI-C actions and… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Despite the parsing power ofLR/LALR algorithms, e.g. YACC, programmers often choose to write recursive-descent parsers by hand to… (More)
  • figure 2
  • figure 4
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?
1985
1985
Compiler writing tools, such as parser generators, are.commonly used to build new operators. Nevertheless, constructing compilers… (More)
Is this relevant?
1979
1979
Time formulas are symbolic formulas which express the execution time of a program as a function of its input data and of… (More)
  • table I
  • figure 1
  • figure 2
  • table II
  • figure 3
Is this relevant?