Holooly Plus Logo

Question 14.3.3: Check if the grammar shown above on p. 202 (having nontermin......

Check if the grammar shown above on p. 202 (having nonterminals E, T and F) is an SLR(1)-grammar.

Step-by-Step
The 'Blue Check Mark' means that this solution was answered by an expert.
Learn more on how do we answer questions.

Yes; both conflicts that prevent it from being a LR(0)-grammar are resolved when we take the next input symbol into account. Indeed, for both T and E+T a shift is possible only when Next = ∗, and the symbol ∗ belongs neither to Follow(E) = {EOI, +, ) } nor to Follow(T) = {{EOI, +, ∗, ) }. Therefore, reduction is impossible when Next = ∗.

Related Answered Questions

Question: 14.4.7

Verified Answer:

Assume that a grammar is fixed. The string S of te...
Question: 14.4.6

Verified Answer:

As before, at each stage of the LR-process we can ...
Question: 14.4.5

Verified Answer:

Assume that a grammar is fixed. Let S be an arbitr...
Question: 14.4.4

Verified Answer:

(1) If a string S is coherent with a situation [K ...
Question: 14.4.3

Verified Answer:

The string S (of terminals and nonterminals) is co...
Question: 14.4.2

Verified Answer:

Now a situation is defined as a pair [situation in...
Question: 14.4.1

Verified Answer:

Nonterminals are symbols (LeftK t) for any nonterm...
Question: 14.2.3

Verified Answer:

Yes, see the corresponding tables (a) and (b) (no ...