KEMBAR78
Unit 2 Part 3 | PDF
Scribd
Upload
8 views9 pages

Unit 2 Part 3

Unit 2 Part 3 for cse 3rd year

Uploaded by

lakshitha lakshitha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views9 pages

Unit 2 Part 3

Unit 2 Part 3 for cse 3rd year

Uploaded by

lakshitha lakshitha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Back Tracking

Top Down Parsing - Start from root + LMD


Recursive Descent
Key Points

● Recursive descent parsing is a top-down parsing technique used in the field of compiler design and syntax analysis
to analyze the structure of a given input based on a formal grammar. It involves breaking down a sequence of tokens
(usually generated by a lexer or tokenizer) into a hierarchical structure defined by the grammar rules of a
programming language or formal language.
● In recursive descent parsing, the process starts at the highest-level construct (usually the start symbol of the
grammar) and recursively works its way down to the terminal symbols (individual tokens) of the input. Each
non-terminal symbol in the grammar is associated with a parsing function, and the parsing process involves
repeatedly calling these functions based on the production rules of the grammar.

You might also like