recursive descent parser

(redirected from Recursive descent parsers)

recursive descent parser

(grammar)
A "top-down" parser built from a set of mutually-recursive procedures or a non-recursive equivalent where each such procedure usually implements one of the productions of the grammar. Thus the structure of the resulting program closely mirrors that of the grammar it recognises.

["Recursive Programming Techniques", W.H. Burge, 1975, ISBN 0-201-14450-6].
This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)

recursive descent parser

Software that breaks down XML data or source code into a visual tree for clarity. Known as a "top-down parser," a recursive descent parser reads the input from left to right in contrast to a "bottom-up parser" (such as a shift-reduce parser) that starts with the right side of a grammatical entity. See XML, parse and recursion.
Copyright © 1981-2019 by The Computer Language Company Inc. All Rights reserved. THIS DEFINITION IS FOR PERSONAL USE ONLY. All other reproduction is strictly prohibited without permission from the publisher.
References in periodicals archive ?
Personally, I tend to write recursive descent parsers, which take a couple of pages of code and provide plenty of flexibility.
Another excellent example is the recursive descent parser, which is very simple and efficient and does not build a data structure for the parse tree.
It consists of coupling actions to recursive descent parsers to produce syntax-trees which are subsequently utilized in guiding the generation of assembly language code.

Full browser ?