DmitrySoshnikov

/**
 * Building LL(1) parsing table from First and Follow sets.
 *
 * by Dmitry Soshnikov <[email protected]>
 * MIT Style License
 *
 * This diff is a continuation of what we started in the previous two diffs:
 *
 * Dependencies:
 *

DmitrySoshnikov

/**
 * LL(1) parser. Building parsing table, part 1: First and Follow sets.
 *
 * NOTICE: see full implementation in the Syntax tool, here:
 * https://github.com/DmitrySoshnikov/syntax/blob/master/src/sets-generator.js
 *
 * by Dmitry Soshnikov <[email protected]>
 * MIT Style License
 *
 * An LL(1)-parser is a top-down, fast predictive non-recursive parser,

DmitrySoshnikov

/**
 * = Recursive descent parser =
 *
 * MIT Style License
 * By Dmitry Soshnikov <dmitry.soshnikov@gmail.com>
 *
 * In this short lecture we'll cover the basic (non-predictive, backtracking)
 * recursive descent parsing algorithm.
 *
 * Recursive descent is an LL parser: scan from left to right, doing

ziadoz

Awesome PHP

Awesome PHP has been relocated permanently to its own Github repository. No further updates will made to this gist.

Please open an issue for any new suggestions.