I'm trying to display a tree graph of my lex / yacc / bison parsing, but really have no idea where to start. This is my first time using lex / yacc, and all the generated files (like calc.yacc_tab.c) are filled with so many #defines and #ifndefs that I don't know where to begin.
The parsing is done and working, and now I just need to somehow display the pathing it takes while tracing through the parsing process. Can anybody give me a starting point for this? I assume recursion is used throughout the process (since it's supposed to be a recursive descent parser), but I don't see where the recursion happens, or where the functions are called from. I'll link the rar file of all the code, and hopefully someone can help!
http://www.talz13.com/downloads/other/project.rar
I'd really like to be able to draw something like the samples on this page, but that is all about ruby, and I don't know how the inner workings of the yacc process go.
TIA,
talz13