tags:

views:

649

answers:

2
+2  Q: 

Recursive descent parser: how to find the FIRST, FOLLOW, and PREDICT sets?

I'm looking for a good explanation of the definitions of the FIRST, FOLLOW, and PREDICT sets of a RDP when given a grammar.

+1  A: 

Try Programming Language Pragmatics, by Michael L. Scott (Morgan Kaufmann). Parsing is covered in chapter 2. Recursive-descent parsing is described in section 2.2.3; first and follow sets in 2.2.5.

Rob Kennedy  2009-02-19 06:52:54
A: 

Update for the 3rd edition, Predict Sets appears in section 2.3.2

Jackin  2009-12-27 10:36:14

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