A grammar G=(V, T, P, S) is __________ if every production taken one of the two forms: B->aC B->a

A grammar G=(V, T, P, S) is __________ if every production taken one of the two forms: B->aC B->a Correct Answer Regular

The following format of grammar is of Regular grammar and is a part of Context free grammar i.e. like a specific form whose finite automata can be generated.

Related Questions

Consider the following two statements: P: Every regular grammar is LL(1) Q: Every regular set has LR(1) grammar Which of the following is TRUE?