CameraIcon

SearchIcon

MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Regular Grammars Part - 2

A context-fre...

Question

A context-free grammar has a set of terminals {0. 1, -}, a set of non-terminals {N, p}, where N is the strats symbol and production s given by the following :

$N \to 0 | P | - P$

$P \to | P 0 | P 1$

What can be said about the language generated by this grammar ?

A

It is CFL.

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

B

It is non-DCFL but CFL

No worries! We‘ve got your back. Try BYJU‘S free classes today!

C

It is regular.

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

D

It is non-regualr but DCFL

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is C It is regular.

Option (a,d)

Suggest Corrections

thumbs-up

0

Similar questions

Q. Which of the following statements are true?
1. Every left-recursive grammar can be converted to a right-recursive grammar and vice-versa.
2. All

ε

-productions can be removed from any context-free grammar by suitable transformations.
3. The language generated by a context-free grammar all of whose productions are of the form X

\to w

\to w Y

(where, w is a string of terminals and Y is a non-terminal), is always regular.
4. The derivations trees of strings generated by a context-free grammar in Chomsky Normal Form are always binary trees.

Q. Consider a CFG with the following productions.

S \to A A | B

A \to 0 A | A 0 | 1

B \to 0 B 00 | 1

S is the start symbol, A and B are non-terminals and 0 and 1 are the terminals. The language generated by this grammar is

Q. In the context-free grammar below, S is the start symbol, a and b are terminals, and

ϵ

denotes the empty strings

S \to

ϵ

A \to

ϵ

The grammar generates the language

Q. In the context-free grammar below, S is the start symbol, a and b are terminals, and

ε

denotes the empty string

S \to a S a | b S b | a | b | ε

Which of the following strings is NOT generated by grammar?

Q. Consider the context-free grammar

E \to E + E

E \to (E * E)

E \to id

where E is the starting symbol, the set of terminals is {id, (, + ,), *} and the set of non-terminals is {E}.

Which of the following terminal strings has more than one parse tree when parsed according to the above grammar?

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Regular Grammars Part - 2

OTHER

Watch in App

explore_more_icon

Explore more

Regular Grammars Part - 2

Join BYJU'S Learning Program

CrossIcon