2 2 votes what is viable prefix in compiler?? Compiler Design parsing + – yankur9 1.0k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
2 2 votes The set of prefixes of right sentential forms that can appear on the stack of a shift-reduce parser are called viable prefixes. An equivalent definition of a viable prefixis that it is a prefix of right sentential form that does not continue past the right end of the rightmost handle of that sentential form Link: https://en.wikipedia.org/wiki/Viable_prefix Arnab Bhadra answered Apr 27, 2017 Arnab Bhadra comment Share Follow See all 4 Comments 4 4 Comments reply Ankit001 commented Jul 18, 2017 reply Follow flag Please give some example 0 0 replyShare Bikram commented Jul 18, 2017 reply Follow flag read this @ankit https://stackoverflow.com/questions/4202181/explanation-about-viable-prefix 0 0 replyShare reena_kandari commented Aug 15, 2017 i edited by reena_kandari Aug 15, 2017 reply Follow flag @Bikram sir confirm this, right sentential form viable prefix E e,E E+T e,E,E+,E+T E+F e,E,E+,E+F E+id e,E,E+,E+id T+id e,T T*F+id e,T,T*,T*F T*id+id e,T,T*,T*id F*id+id e,F, id*id+id e,id 1 1 replyShare joshi_nitish commented Aug 15, 2017 reply Follow flag correct, viable prefix also includes handles.. 0 0 replyShare Please log in or register to add a comment.
