Scribd
Upload
9 views3 pages

Predictive Parser

A predictive parser is a type of recursive descent parser that predicts which production to use without backtracking, utilizing a stack and a parsing table to generate parse trees. The LL parser, specifically LL(1), processes input from left to right and derives the left-most production, with a deterministic algorithm that checks if a string belongs to a given grammar. A grammar is LL(1) if it meets specific conditions regarding its productions and their derivations.

Uploaded by

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

Predictive Parser

A predictive parser is a type of recursive descent parser that predicts which production to use without backtracking, utilizing a stack and a parsing table to generate parse trees. The LL parser, specifically LL(1), processes input from left to right and derives the left-most production, with a deterministic algorithm that checks if a string belongs to a given grammar. A grammar is LL(1) if it meets specific conditions regarding its productions and their derivations.

Uploaded by

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

Predictive Parser

Predictive parser is a recursive descent parser, which has the capability to predict which
production is to be used to replace the input string. The predictive parser does not suffer from
backtracking.

Figure 1 LL(1) PARSER

Predictive parsing uses a stack and a parsing table to parse the input and generate a parse tree.
Both the stack and the input contains an end symbol $ to denote that the stack is empty and the
input is consumed. The parser refers to the parsing table to take any decision on the input and
stack element combination.

LL Parser

LL parser is denoted as LL(k). The first L in LL(k) is parsing the input from left to right, the
second L in LL(k) stands for left-most derivation and k itself represents the number of look
aheads. Generally k = 1, so LL(k) may also be written as LL(1).
Figure 2 LL(1) PARSER

LL Parsing Algorithm

We may stick to deterministic LL(1) for parser explanation, as the size of table grows
exponentially with the value of k. Secondly, if a given grammar is not LL(1), then usually, it is
not LL(k), for any given k.

Given below is an algorithm for LL(1) Parsing:

Input:
string ω
parsing table M for grammar G

Output:
If ω is in L(G) then left-most derivation of ω,
error otherwise.

Initial State : $S on stack (with S being start symbol)


ω$ in the input buffer

SET ip to point the first symbol of ω$.

repeat
let X be the top stack symbol and a the symbol pointed by ip.

if X∈ Vt or $
if X = a
POP X and advance ip.
else
error()
endif

else /* X is non-terminal */
if M[X,a] = X → Y1, Y2,... Yk
POP X
PUSH Yk, Yk-1,... Y1 /* Y1 on top */
Output the production X → Y1, Y2,... Yk
else
error()
endif
endif
until X = $ /* empty stack */

A grammar G is LL(1) if A → α | β are two distinct productions of G:

 for no terminal, both α and β derive strings beginning with a.


 at most one of α and β can derive empty string.
 if β → t, then α does not derive any string beginning with a terminal in FOLLOW(A).

You might also like