#Made Easy practice Book # Left-Recursion
in Compiler Design
0 votes
0 votes
Given a LR grammar {S->A|B, A->Aa|epsilon, B->Bb|Sc|epsilon} can I solve it in following way?
1) S->A|Bb|Sc|epsilon (Placing B’s productions in S)
=> AS' | BbS' | epsilon & S'->cS' | epsilon
2) A->A' & A'->aA' | epsilon
3)B->ScB' | B' & B'->bB' | epsilon
in Compiler Design
5 points

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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.