Question

Consider the following grammar with set of non-terminals as {S, D, L} and set of

terminals as {d, ;, {, }, x}. S is the start symbol.
→ {; }

→ ;|

→ ; |
Construct LR (0) set of items and GOTO graph (DFA). Is it possible to construct LR

(0) parsing table for above grammar? If yes, construct it. If no, justify by identifying

the conflicts and states in which they occur.​

Answer 1

Explanation:

Create a web page and set its Title as 'My Classmates'.

Set the top margin of the web page to 75.

Set Table border Size to 3 pixels and border color to 'Green'.

Table Height should be 250 pixels and width should be 500

My Classmates

pixels.

Align the table in center of the web page.

Create 5 columns in the table named as S.No, Name, Birthday, E-mail ID and Phone No.

Create five rows in the table and enter records of your five classmates.

Set the background colour and border colour of the heading row to 'Pink' and 'Blue' respectively.

Set CellPadding attribute of the table to 5.

Set CellSpacing property of the table to 5.