Parse Tree lex and yacc
Budget: ₹600 – ₹1,500 INR
I want to build a project using lex and yacc of infix to prefix. and also to print parse tree of program
- additional module:
instead of +,-, * ,/, if we put '?' it will give 4 answers considering '?' as '+,-,*,/'
INPUT - a+b+c
OUTPUT - parse tree + output of it
INPUT - a?b?c
OUTPUT - parse tree + 4 output
- additional module:
instead of +,-, * ,/, if we put '?' it will give 4 answers considering '?' as '+,-,*,/'
INPUT - a+b+c
OUTPUT - parse tree + output of it
INPUT - a?b?c
OUTPUT - parse tree + 4 output