tags:

views:

32

answers:

1
+1  Q: 

How do you constrct a parse tree from a stream of tokens?

Does anyone know what is the general method for turning a stream (or a list) of tokens into a parse tree?

I am dying to know this. I haven't programmed stuff like this and would love to learn it!

Thanks, Boda Cydo.

+2  A: 

The process you're talking about is known as parsing. There is several options to do this. You can either use a tool such as YACC to do the parsing for you or you could implement your own parser. A popular parser that is well used is the Recursive Descent Parser. You will find lots of reading about it on the web and wikipedia has a good code example too.

monoceres  2010-02-22 00:13:18

related questions

BNF grammar test case generation
Print stack trace information from C#
What is a good way to format logs?
How do you parse a filename in bash?
How to parse a string into a nullable int in C# (.NET 3.5)
An easy way to diff log files, ignoring the time stamps?
Learning Resources on Parsers, Interpreters, and Compilers
Does C# have built-in support for parsing page-number strings?
Resources for lexing, tokenising and parsing in python
Parsing, where can I learn about it.
Parsing XML using unix terminal
Equation (expression) parser with precedence?
What HTML parsing libraries do you recommend in Java
Where do I get the Antlr Ant task?
How do I put unicode characters in my Antlr grammar?
Resolving reduce/reduce conflict in yacc/ocamlyacc
Best Approach to Parse for SQL in PHP Files?
.Net Parse verses Convert
How can I learn about parser combinators?
Parse usable Street Address, City, State, Zip from a string
C# Save Dialogs
Delimited string parsing framework for .NET
Looking for algorithm that reverses the sprintf() function output
Split a string ignoring quoted sections
What is the best way to parse strings in Java