I’m writting a parser using Lex and Yacc for a compiler class. The error recovery is quite hard to implement and the symbol table output the way Clarkson (the professor) wants isn’t possible from my understanding of parsers.

Let’s say you have the following micro-pascal code: num1 := 34;
He wants us to output the symbol table like with the following: INTEGER num1 34

Can anyone explain how that’d be possible in a parser if parsers don’t process code?!