MyQuestionIcon

1

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

Objective Session 3

Consider the ...

Question

Consider the grammar with following productions.
S $\to$ a $α$ b | b $α$ c | ab
S $\to$ $α$ S| b
S $\to$ $α$ bb |ab
S $α$ $\to$ bdb| bd
the above grammar is

Open in App

Solution

S $\to$ a $α$ b | b $\to$ c | ab
S $\to$ $α$ S| b
S $\to$ abb |ab
S $α$ $\to$ bdb| bd
Since the LHS of the production S $α$ $\to$ bdb| bd which is S $α$ does not belong to variable set V,the grammar is not a CFG (type 2).However since in all the productions length of LHS $\leq$ length of RHS.the grammar is type 1 (CSG).

Suggest Corrections

thumbs-up

0

Similar questions

Q. The following Context-Free Grammar (CFG):
S

\to

\to

\to

b | bS | aBB
may generates(s)

Q. Consider the following context-free grammar over the alphabet

\sum = {a, b, c}

with S as the start symbol:

S \to a b S c T | a b c T

T \to b T | b

Which one of the following represents the language generated by the above grammar?

S \to a S a | b S | c

Q. Consider the following grammar.

S \to A B A \to (S) | a S b | d B \to a B | ε

I f X = F i r s t (S), Y = F i r s t (A) a n d Z = F i r s t (B) t h e n (X \cap Y) - Z

Q. For the grammar below, a partial LL(1) parsing table is also presented along with the grammar. Entries that need to be filled are indicated as E1, E2, and E3.

ε

is the empty string, $ indicates end of input, and | separates alternate right hand sides of productions.

S \to a A b B | b A a B | ε

A \to S

B \to S

	a	b	$
S	E1	E2	$S \to ε$
A	$A \to S$	$A \to S$	error
B	$B \to S$	$B \to S$	E3

The FIRST and FOLLOW sets for the non-terminals A and B are

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Objective Session 3

OTHER

Watch in App

explore_more_icon

Explore more

Objective Session 3

Join BYJU'S Learning Program

CrossIcon