Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I have already written a lexer which returns tokens, and now I’m working on a parser. I have one problem.
Imagine this code example:
print("Hello, world!")
The lexer returns four tokens (print, (, "Hello, world!" and )). The final program should print the string “Hello, world!”.
But what should the parser do? Should the parser already execute the code, should it return something (and what) that is handled by another object?
The parser should generate an abstract syntax tree, which is an in memory representation of the program. This tree can be traversed after parsing to do the code generation. I’d recommend to read some good book about the subject, maybe one involving dragons.