0 votes 0 votes If a non deterministic CFL is not inherently ambiguous can it be parsed by some LR(1) parser?? Compiler Design compiler-design parsing + – sushmita asked Aug 27, 2017 sushmita 266 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Habibkhan commented Aug 27, 2017 reply Follow Share Not necessarily..An unambiguous grammar may also lead to conflicts in LR(k) grammar..We can say the above statement clearly for DCFL i.e. for a DCFL we have an LR(k) grammar..In fact LR(1) or LR(0) grammar..LR(0) grammar is possible for a DCFL if it has prefix property.. 1 votes 1 votes sushmita commented Aug 27, 2017 reply Follow Share thanx a lot for clearing the concept. 1 votes 1 votes Please log in or register to add a comment.
