Question: Given context free grammar: G = ( V , T , P , S ) Production rules: S - > aB | bA | a

Given context free grammar:
G =(V, T, P, S)
Production rules:
S-> aB | bA | a
A-> bB | a
B-> aA | b
where A,B in V and a,b in \Sigma
is the context free grammar with the productions regular? true or false

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!