Lines Matching refs:to
26 This library allows to manipulate LL(1) and LL(k) compiler compilers. A
34 With [Composer](https://getcomposer.org/), to include this library into
35 your dependencies, you need to
53 Then, to run all the test suites:
70 the documentation for an introduction to the language theory). The PP language
126 * `rule()` to call a rule;
127 * `<token>` and `::token::` to declare a token;
129 * `(…)` to group multiple declarations;
130 * `e?` to say that `e` is optional;
131 * `e+` to say that `e` can appear at least 1 time;
132 * `e*` to say that `e` can appear 0 or many times;
133 * `e{x,y}` to say that `e` can appear between `x` and `y` times;
134 * `#node` to create a node the AST (resulting tree);
135 * `token[i]` to unify tokens value between them.
161 The `Hoa\Compiler\Llk\Llk` class provide helpers to manipulate (load or save) a
162 compiler. The following code will use the previous grammar to create a compiler,
164 (stands for Abstract Syntax Tree) we can visit, for example to dump the AST:
195 This library proposes a script to parse and apply a visitor on a data with a
232 Some algorithms are available to generate data based on a grammar. We will give
269 detailed information about how to use this library and how it works.
283 There are mainly two ways to get help:
291 Do you want to contribute? Thanks! A detailed [contributor
293 everything you need to know.