Awesome q2a theme
0 votes
12 views

Consider the following grammar

        SS ; T  | T

        Ts

  1. Construct DFA of LR(1) Items
  2. Show the parsing stack for the input string s;s;s
in Compiler Design by (5 points) | 12 views
0
how it can be a self doubt ?

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
9,105 questions
3,156 answers
14,594 comments
95,955 users