Data Structures and Algorithms in C++: Pocket Primer (Pocket Primer Series) by Lee Wittenberg

Author:Lee Wittenberg [Wittenberg, Lee]
Language: eng
Format: epub, azw3
Publisher: Mercury Learning and Information
Published: 2017-04-18T21:00:00+00:00

5.5 EXAMPLE: RECURSIVE DESCENT PARSING

Perhaps the most interesting (and useful) application of recursion is recursive descent parsing. This is best illustrated with an example. An infix expression can be defined recursively:

An expression is a sequence of one or more terms separated by additive operators (‘+’ or ‘-’),

A term is a sequence of one or more factors separated by multiplicative operators (‘*’ or ‘/’),

A factor is either an integer constant, or an expression enclosed in parentheses.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.