Question: Consider the following two grammars G 1 : S - > SbS | a Pattern ababa G 2 : S - > aB | ab

Consider the following two grammars
G1: S -> SbS | a
Pattern ababa
G2: S -> aB | ab, A -> AB | a, B -> ABb | b
Pattern ab
Check for ambiguity in both the grammars, give all possible
parse tree generation for the patterns.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!