Please enable JavaScript.
Coggle requires JavaScript to display documents.
Topic 4B (LL(1) GRAMMARS (S1: Ɛ -find nullable rule -find nullable non…
Topic 4B
LL(1) GRAMMARS
S1: Ɛ
-find nullable rule
-find nullable non-terminal
S2 : BDW
S3 : BW
-From BDW find reflexive and transitive closure
S4 : First (α)
S5 : First (n)
S6 : FDB
S7 : DEO
S8 : EO
S9 : FB
S10 : FB↲
S11 : Fol(Ɛ)
S12 : Sel(n)
SELECTION SET
set of input symbols which imply application of a grammar rule
have exactly one terminal symbol (first letter on right side of rule)
rules defining the same non-terminal must have disjoint
TOP-DOWN PARSING
.
grammar rules applied top-down direction
start with starting non terminal
RELATIONS AND CLOSURE
[TRANSITIVE] (a,b) , (b,c) = (a,c)
[REFLEXIVE] each pair with same elements
SIMPLE GRAMMAR
every rules starts with a terminal
every rules should have different starting terminals
QUASI-SIMPLE GRAMMAR
rules contains epsilon symbol or an empty set
Follow sets need to be find