The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
33 views

How many Minimum number of Backtracks Required :- 

Soln. 

According to me it Max = 3 and Min = 0, because left factoring is there, and say compiler was lucky and chooses the production which finally leads to desired string in one go i.e. S -> aAb -> aab.  So 0 backtracks there isn't it ?

Please Verify if something is wrong?

asked in Compiler Design by Loyal (8.1k points) | 33 views
+1
Yeah you are right min. will be 0 and max will be 3 because B has two choice so 2 backtracking there ,still we don't get our string but we choose S->aAb, A also have two choice but at second choice we will get our required string so only max 3 backtracking there.

Please log in or register to answer this question.

Related questions

0 votes
1 answer
2


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

47,080 questions
51,333 answers
177,707 comments
66,675 users