Describe the two ways of contructing a parse tree giving


1.Given the GRAMMAR
z::= V0/V1
V:: = Z1/1
V:: = Z0/0
Draw the state digram
2. Use the state diagram in (1) to recognise the sentence 101001,show the syntax tree.
3.Describe the two ways of contructing a parse tree giving examples of each.
4Let G= (VN,VT,P,S), VN =(S,B,C) VT= (a,b,c).P consists of the following productions:
S- aSBc
S- aBC
CB- BC
aB-ab
bB-bb
bC-bc
cC-cc
show that language L(G)contains the word anbncn for each n>=1
4.Describe the following types of grammar:
(i)type-0 (ii)types-1 (iii)types-2 (iv)types-3
5.Given the following context -free Grammar G
R- xRx/s
S-aTblbTa
T-xTxlxlE
X- alb
(i) what are the variables of G?
(ii)what are the terminal of G?
(iii)which is the start variable of G?
(iv)Give three strings in L(G)
(v)Give three strings not in L(G) 

Request for Solution File

Ask an Expert for Answer!!
Basic Computer Science: Describe the two ways of contructing a parse tree giving
Reference No:- TGS0124695

Expected delivery within 24 Hours