Original Post
🔒 Locked
Need Help
Advertisement
If you want to do it by hand, I''d look up an article about recursive decent parsing. There are also some decent threads about this in the forums if you can get the search to find them.
For automated tools, I''d recommend lex and yacc (or some of the variants like flex and bison). There are some pretty good tutorials on how to use them on the net. Alternately, you can try the book "Lex and Yacc" by John Levine, Tony Mason, and Doug Brown.
For automated tools, I''d recommend lex and yacc (or some of the variants like flex and bison). There are some pretty good tutorials on how to use them on the net. Alternately, you can try the book "Lex and Yacc" by John Levine, Tony Mason, and Doug Brown.
Something that simple can easily be done with a recursive descent parser. If you can use C++ though, look into spirit (boost.org), it''s a C++ meta-language parser, that I''ve found to be both powerful and easy to use.
Topic Locked
This topic has been locked by a moderator. New replies are not allowed.
Sign in to reply to this topic.
Advertisement