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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

As a major threat to cyber security, malware has been increasingly damaging national security. This paper proposes a malware…

2014

2007

The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which…

2004

The well-known recursive descent parsing method for context-free grammars is extended for their generalization, Boolean grammars…

2004

This paper presents modifications to a standard probabilistic context-free grammar that enable a predictive parser to avoid…

1998

This paper presents a construct for mapping arbitrary non-left recursive context-free grammars into recursive descent parsers…

1994

We define a class of relation grammars that satisfy the context-freeness property, which is an essential condition to solve the…

1990

A variant of the well‐known recursive descent parsing technique is developed, based on the assumption that each non‐terminal of…

1985

Compiler writing tools, such as parser generators, are‐commonly used to build new operators. Nevertheless, constructing compilers…

1973