Recursive descent parsing in Compiler Design - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is recursive descent parsing?

Recursive descent parsing is a method of analyzing a sentence or code by breaking it down into smaller parts using a set of functions that call themselves to match grammar rules.

beginner

How does recursive descent parsing handle grammar rules?

It uses one function per grammar rule. Each function tries to match parts of the input according to that rule, calling other functions for sub-rules as needed.

intermediate

What kind of grammar is best suited for recursive descent parsing?

Recursive descent parsing works best with LL(1) grammars, which are simple and do not have left recursion or ambiguous rules.

intermediate

What is left recursion and why is it a problem for recursive descent parsing?

Left recursion happens when a grammar rule calls itself first, causing infinite loops in recursive descent parsing. It must be removed or rewritten.

beginner

What is the main advantage of recursive descent parsing?

It is easy to understand and implement by hand, making it good for simple languages and teaching parsing concepts.

What does each function in recursive descent parsing represent?

A A variable

B A grammar rule

C A token

D An error handler

Each function corresponds to one grammar rule and tries to match input according to that rule.

Which grammar type is NOT suitable for recursive descent parsing?

A Left recursive

B Right recursive

C LL(1)

D Simple context-free

Left recursive grammars cause infinite recursion in recursive descent parsing and must be avoided.

What happens if recursive descent parser encounters left recursion?

A It skips the rule

B It parses correctly

C It loops infinitely

D It throws a syntax error

Left recursion causes the parser to call the same function repeatedly without progress, leading to infinite loops.

Why is recursive descent parsing easy to implement?

A Because it uses complex algorithms

B Because it uses machine learning

C Because it requires no grammar

D Because it uses one function per grammar rule

Its structure mirrors the grammar, making it straightforward to write functions for each rule.

What is the main role of recursive calls in recursive descent parsing?

A To match nested grammar rules

B To tokenize input

C To optimize speed

D To handle errors

Recursive calls allow the parser to process nested or hierarchical grammar structures.

Explain how recursive descent parsing works using a simple example.

Think about how each grammar rule can be a function that calls others.

Describe why left recursion is a problem in recursive descent parsing and how it can be fixed.

Consider what happens when a function calls itself first without consuming input.

Practice

1. What is the main idea behind recursive descent parsing?

easy

A. Using a single loop to scan the input once

B. Converting input into machine code directly

C. Using functions that call themselves to analyze input step-by-step

D. Using tables to decide parsing actions

Solution

1. Step 1: Understand recursive descent parsing concept

   Recursive descent parsing uses functions that call themselves to process parts of the input one by one.

2. Step 2: Compare options with concept

   Only Using functions that call themselves to analyze input step-by-step describes this method correctly; others describe different parsing or compilation techniques.

3. Final Answer:

   Using functions that call themselves to analyze input step-by-step -> Option C

4. Quick Check:

   Recursive descent = functions calling themselves [OK]

Hint: Look for self-calling functions in parsing [OK]

Common Mistakes:

• Confusing recursive descent with table-driven parsing
• Thinking parsing is done in one pass without recursion
• Mixing parsing with code generation

2. Which of the following is a correct syntax feature of a recursive descent parser function?

easy

A. It calls itself to process nested grammar rules

B. It uses a while loop to parse all tokens at once

C. It directly generates machine code

D. It uses a global variable to store the entire parse tree

Solution

1. Step 1: Identify function behavior in recursive descent parsing

   Functions in recursive descent parsers call themselves to handle nested or repeated grammar parts.

2. Step 2: Evaluate options

   It calls itself to process nested grammar rules correctly states this behavior. Options B, C, and D describe unrelated or incorrect features.

3. Final Answer:

   It calls itself to process nested grammar rules -> Option A

4. Quick Check:

   Recursive descent functions call themselves [OK]

Hint: Look for self-calling function behavior [OK]

Common Mistakes:

• Assuming loops replace recursion in these functions
• Confusing parsing with code generation
• Thinking parse tree is stored globally by default

3. Given this simple grammar rule:
Expr -> 'a' Expr | 'b'
What will a recursive descent parser output when parsing the input aaab?

medium

A. Successfully parses the input

B. Syntax error at first character

C. Infinite recursion without stopping

D. Parses only the first character

Solution

1. Step 1: Understand the grammar and input

   The rule says Expr can be 'a' followed by Expr again, or just 'b'. Input 'aaab' fits this pattern: 'a' + 'a' + 'a' + 'b'.

2. Step 2: Trace parsing steps

   The parser calls Expr recursively for each 'a', finally matching 'b' and stopping successfully.

3. Final Answer:

   Successfully parses the input -> Option A

4. Quick Check:

   Input matches recursive pattern = success [OK]

Hint: Match input step-by-step with grammar rules [OK]

Common Mistakes:

• Thinking recursion never ends here
• Assuming syntax error on repeated 'a's
• Believing parser stops after first character

4. What is the main problem if a recursive descent parser function calls itself without consuming any input tokens?

medium

A. It generates an incorrect parse tree but finishes

B. It correctly parses empty input

C. It skips tokens and misses errors

D. It causes infinite recursion leading to a crash

Solution

1. Step 1: Analyze recursion without input consumption

   If a parser function calls itself but does not move forward in the input, it repeats the same call endlessly.

2. Step 2: Understand consequences

   This causes infinite recursion, which usually crashes the program or stack overflow.

3. Final Answer:

   It causes infinite recursion leading to a crash -> Option D

4. Quick Check:

   No input consumed + recursion = infinite loop [OK]

Hint: Check if input advances before recursive call [OK]

Common Mistakes:

• Assuming parser can handle infinite recursion gracefully
• Thinking empty input is always valid
• Believing parse tree is built despite infinite recursion

5. How can left recursion in grammar rules cause problems in recursive descent parsing, and what is a common solution?

hard

A. Left recursion causes syntax errors; add more tokens to grammar

B. Left recursion causes infinite recursion; rewrite grammar to remove left recursion

C. Left recursion causes slow parsing; use iterative loops instead

D. Left recursion causes missing parse trees; use global variables

Solution

1. Step 1: Understand left recursion problem

   Left recursion means a rule calls itself first without consuming input, causing infinite recursion in recursive descent parsers.

2. Step 2: Identify common solution

   To fix this, grammars are rewritten to remove left recursion, often by using right recursion or iteration.

3. Final Answer:

   Left recursion causes infinite recursion; rewrite grammar to remove left recursion -> Option B

4. Quick Check:

   Left recursion = infinite recursion; fix by rewriting [OK]

Hint: Rewrite grammar to eliminate left recursion [OK]

Common Mistakes:

• Thinking adding tokens fixes left recursion
• Assuming loops replace recursion without grammar change
• Believing global variables solve recursion issues