The Gateway to Computer Science Excellence
0 votes
68 views
what is sequence order of solving LR(K) grammar, if the question is asking about SLR, CLR, LALR? what is sequence after solving SLR(1) (assume till now grammar is not SLR(1)), then proceed for LALR/CLR DFA???
in Compiler Design by | 68 views
0
LR(0) then SLR(1), then CLR(1), then LALR(1).

However SLR(1)$\subseteq$ LALR(1)$\subseteq$CLR(1)
0
You need to find CLR first, because after finding it then you will be able to find whether the given grammar is LALR or not after merging of the 2 states having same lookahead.

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
52,315 questions
60,433 answers
201,778 comments
95,257 users