0 votes 0 votes Construct a NPDA corresponding to the grammar. $S \rightarrow AA|a$ $A\rightarrow SA|b$ also convert the given grammar to GNF. Theory of Computation theory-of-computation peter-linz peter-linz-edition4 pushdown-automata npda + – Mk Utkarsh asked Mar 25, 2018 • edited Mar 4, 2019 by Naveen Kumar 3 Mk Utkarsh 600 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments srestha commented Mar 26, 2018 reply Follow Share @ Mk Utkarsh http://www.iitg.ac.in/gkd/ma513/oct/oct18/note.pdf See from here all rules applied or not 1 votes 1 votes Mk Utkarsh commented Mar 28, 2018 reply Follow Share I'm trying to follow but grammar is getting HUGE. I'm still stuck 0 votes 0 votes srestha commented Mar 28, 2018 reply Follow Share Have u done with $A_{1},A_{2},A_{3}$..... like that? It is really taking time Can we not do it by removing left recursion and then simply making it a GNF? 0 votes 0 votes Please log in or register to add a comment.
