0 votes 0 votes Is it possible, by modifying the grammar in any way, to construct a predictive parser for the language of $S\rightarrow SS + \mid SS {\ast} \mid a$ (postfix expressions with operand a)? Compiler Design ullman compiler-design predictive-parser descriptive + – admin asked Aug 20, 2019 • edited Aug 20, 2019 by Lakshman Bhaiya admin 219 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.