||~R_girl~||

Member
Mar 21, 2008
34,536
460
0
Does anyone here know about ;
Context-free Grammars
Parse Trees
Recursive Descent Parsing
Deterministic Grammars


pretty please!!??? anyone??? :sorry:
 

||~R_girl~||

Member
Mar 21, 2008
34,536
460
0
what do u want to know? write down ur questions on here I will see what can I do for u.

Given below is the grammer:
S → A | R | IF B S ENDIF; | SS | ε
A → I := E;
R → RETURN I;
I → char(char)∗
E → digit | E + E | I
B → (E == E)

I wanna know how to give the parse tree for
x := y+z;
IF (x == z+1) y:=5; RETURN y; ENDIF;


this is just a teeny part of one one my assignments and i have no idea where to begin from.i feel so dumb right now :dull:
 

aruna47

Well-known member
  • Given below is the grammer:
    S → A | R | IF B S ENDIF; | SS | ε
    A → I := E;
    R → RETURN I;
    I → char(char)∗
    E → digit | E + E | I
    B → (E == E)

    I wanna know how to give the parse tree for
    x := y+z;
    IF (x == z+1) y:=5; RETURN y; ENDIF;


    this is just a teeny part of one one my assignments and i have no idea where to begin from.i feel so dumb right now :dull:

    wait checking........... beep beep beep