GATEverse
← GATE CSE 1998

Q6b

NATMarks unknown

Consider the grammar S →Aa∣b\rightarrow Aa \mid b A →Ac∣Sd∣ϵ\rightarrow Ac \mid Sd \mid \epsilon Construct an equivalent grammar with no left recursion and with minimum number of production rules.

Sign in to save attempts.

Loading…