0 votes 0 votes Every regular set has an LR(1) grammar. What does this line mean?? Compiler Design compiler-design parsing grammar + – Vegeta asked Sep 19, 2018 Vegeta 223 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Prateek Raghuvanshi commented Sep 19, 2018 reply Follow Share For a language more than one grammars are possible ,also for regular language more than one grammar is possible in which many of them may be ambigous grammar.since we know that for regular language DFA is possible means at least one unambiguous grammar should be exist for dfa,so regular languages are unambiguous.LR(1) grammars also unambiguous so we can say that for that dfa ,an LR(1) grammar should be present. 0 votes 0 votes Vegeta commented Sep 19, 2018 reply Follow Share here regular set means the collection of strings and the collection of strings is the regular language. It means every regular language has LR(1) grammar. What i understand, for any regular language there exist a LR(1) grammar that generates that language. What do you think? Am i on right track. Second what does this line mean "there are a type of bottom-up parsers that efficiently handle deterministic context-free languages(DCFL) in guaranteed linear time" Efficiently handles means 0 votes 0 votes Please log in or register to add a comment.
