# Question 14.3.2: Assume that a SLR(1)-grammar is given. Prove that each strin......

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.

Step-by-Step
The 'Blue Check Mark' means that this solution was answered by an expert.

We repeat the argument used for LR(0)-grammars. The difference is that the choice of the next action depends on the next input symbol (Next).

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

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

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

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

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

(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? ...

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

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

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

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

Yes; both conflicts that prevent it from being a L...
Question: 14.4.1