0 votes 0 votes Compiler Design compiler-design parsing lr-parser numerical-answers made-easy-test-series + – saxena0612 asked Nov 28, 2017 • retagged Jun 22, 2022 by Lakshman Bhaiya saxena0612 476 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply abhishek tiwary commented Nov 28, 2017 reply Follow Share 40 token is correct?? 0 votes 0 votes saxena0612 commented Nov 28, 2017 reply Follow Share I think so ! but they have considered right shift and equal to as 2 separate token i don`t know why ! 0 votes 0 votes joshi_nitish commented Nov 28, 2017 reply Follow Share first(S) = first(B) = {a, b, eps} is correct. 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes Q31. Stages are 14 Q11 Akash Mittal answered Nov 28, 2017 Akash Mittal comment Share Follow See all 6 Comments See all 6 6 Comments reply saxena0612 commented Nov 28, 2017 reply Follow Share >>= should be one token right? And second doubt in dfa why there is not transition for Null? 0 votes 0 votes Akash Mittal commented Nov 28, 2017 reply Follow Share >> {right shift}and = {assignment} are two separate tokens. C--->epison is already in reduce stage. 0 votes 0 votes saxena0612 commented Nov 28, 2017 reply Follow Share So are ! = these but greedy technique used in compilers states that we should always follow longest token sequence. And how its reduced? we should state that position right?, reduction without any input should also be one state. I didn`t get this concept in dragon as well. @ joshi_nitish need your comment why we are not having one separate state for reduction without anything like a production using epsilon 0 votes 0 votes joshi_nitish commented Nov 28, 2017 reply Follow Share yes, A->eps is already in reduced form, so we dont need any further reduction transition 0 votes 0 votes abhishek tiwary commented Nov 30, 2017 reply Follow Share <<= have 2 token but<=have single right?? 0 votes 0 votes Psy Duck commented Oct 28, 2022 reply Follow Share @Akash Mittal >>= is a single token! 0 votes 0 votes Please log in or register to add a comment.