1 votes 1 votes What language is generated by the following grammer? S→ a | S+S | SS | S* | (S) Compiler Design compiler-design context-free-grammar + – aditi19 asked Mar 19, 2019 aditi19 434 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes for writing regular expression . we need three operator like Union: If R1 and R2 are regular expressions, then R1 | R2 (also written as R1 U R2 or R1 + R2) is also a regular expression. Concatenation: If R1 and R2 are regular expressions, then R1.R2 (also written as R1.R2) is also a regular expression. Kleene closure: If R1 is a regular expression, then R1* (the Kleene closure of R1) is also a regular expression. so this grammar is converting into regular expression. abhishekmehta4u answered Mar 19, 2019 selected Mar 19, 2019 by aditi19 abhishekmehta4u comment Share Follow See all 4 Comments See all 4 4 Comments reply aditi19 commented Mar 19, 2019 reply Follow Share yes.. thank u... but one silly question.. ( S ).. what does this imply in regular expression? 1 votes 1 votes abhishekmehta4u commented Mar 19, 2019 reply Follow Share it is just a bracket. we can genrate regular expression like (aa+aaa)*. 1 votes 1 votes kirtipurohit commented Feb 27, 2021 reply Follow Share But this grammar is ambiguous? Can it be regular? 0 votes 0 votes Hira Thakur commented Feb 27, 2021 reply Follow Share kirtipurohit yes, this is ambiguous grammar. 0 votes 0 votes Please log in or register to add a comment.