Hi everyone!
I'm going building a compiler that have as input a pseudocode of recursive algorithm and as output generate all the execution environments for show the variation of the input in each environment and then generate the recurrence of this algorithm.
I have an idea: First make a grammar for my custom language (It's something like pascal), seconds build a compiler that have as output JAVA code and then make the analysis of JAVA code for generate the recurrence.
My question is: ¿Is this a good strategy?, ¿Can i use SableCC for this purpose or there is other better tool ?
Thanks.