What is context free grammar in compiler design?
Answers
Answered by
1
It is a type-2 Grammar.
It has 4 tuples : G = (V,T,P,S)
V = Finite set of variables.
T = Set of terminals
P = Set of rules.
S = Start Symbol
Hope this helps!
It has 4 tuples : G = (V,T,P,S)
V = Finite set of variables.
T = Set of terminals
P = Set of rules.
S = Start Symbol
Hope this helps!
Similar questions
Business Studies,
8 months ago
Math,
8 months ago
Computer Science,
8 months ago
Science,
1 year ago
English,
1 year ago
Math,
1 year ago
Chemistry,
1 year ago