Are the following grammars LR(0)-grammars?

\begin{array}{r l l}{{\mathrm{(a)}\quad{\mathrm{T}}\quad\rightarrow}}&{{0}}\\ {{\mathrm{T}}}&{{\rightarrow}}&{{\mathrm{T1}}}\\ {{\mathrm{T}}}&{{\rightarrow}}&{{\mathrm{T}\mathrm{T}2}}\\ {{\mathrm{T}}}&{{\rightarrow}}&{{\mathrm{TT}\mathrm{T}3}}\end{array} \begin{array}{r l l}{{\mathrm{(b)}\quad{\mathrm{T}}\quad\rightarrow}}&{{0}}\\ {{\mathrm{T}}}&{{\rightarrow}}&{{1\mathrm{T}}}\\ {{\mathrm{T}}}&{{\rightarrow}}&{{2\mathrm{T}\mathrm{T}}}\\ {{\mathrm{T}}}&{{\rightarrow}}&{{3\mathrm{TT}\mathrm{T}}}\end{array}Step-by-Step

Learn more on how do we answer questions.

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

Question: 14.2.4

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

Question: 14.4.7

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

Question: 14.4.6

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

Question: 14.4.5

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

Question: 14.4.4

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

Question: 14.4.3

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

Question: 14.4.2

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

Question: 14.3.3

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

Question: 14.4.1

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

Question: 14.3.2

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