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

Algorithms and Programming: Problems and Solutions [1518855]

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.2.4

Assume that an LR(0)-grammar is given. Prove that each string has at most one rightmost derivation. Give an algorithm that checks whether the input string is derivable. ...

Verified Answer:

Assume that an arbitrary input string is given. We...

Question: 14.4.7

Find and prove the connection between the notions of LR(0)-coherence and LR(1)-coherence. ...

Verified Answer:

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

Question: 14.4.6

For any LR(1)-grammar, construct an algorithm that checks if a given string is derivable in the grammar. ...

Verified Answer:

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

Question: 14.4.5

Give the definition of the shift/reduce and shift/shift conflicts in the LR(1)-case. ...

Verified Answer:

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

Question: 14.4.4

Show how to compute inductively the set State(S) of all situations coherent with a given string S. ...

Verified Answer:

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

Question: 14.4.3

How to modify the definition of a string coherent with a situation? ...

Verified Answer:

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

Question: 14.4.2

How should we modify the definition of a situation? ...

Verified Answer:

Now a situation is defined as a pair [situation in...

Question: 14.4.1

Write a grammar whose nonterminals generate the sets Left(K, t) for all nonterminals K of the given grammar. ...

Verified Answer:

Nonterminals are symbols (LeftK t) for any nonterm...

Question: 14.2.3

Are the following grammars LR(0)-grammars? ...

Verified Answer:

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

Question: 14.3.2

Assume that a SLR(1)-grammar is given. Prove that each string has at most one rightmost derivation. Give an algorithm to check whether a given string is derivable in the grammar. ...

Verified Answer:

We repeat the argument used for LR(0)-grammars. Th...