LL Analyzer Implementation
1) Recursive-Descent Parsing
• Each nonterminal is represented by a
procedure, which perform
its analysis:
A
X1
X2
Xn
…
Rule r1:
Input
string
function A: boolean;
begin
{X1 analysis}
{X2 analysis}
…
{Xn analysis}
end
• Table-driven syntax analyzer with pushdown
Input string
S
These symbols are in the pushdown.
41/57
S
A
® X1X2…Xn
