This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* LL(1) parser. Building parsing table, part 1: First and Follow sets. | |
* | |
* by Dmitry Soshnikov <[email protected]> | |
* MIT Style License | |
* | |
* An LL(1)-parser is a top-down, fast predictive non-recursive parser, | |
* which uses a state-machine parsing table instead of recursive calls | |
* to productions as in a recursive descent parser. | |
* |