Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Add dot symbol matching any single character | Ryo Nihei | 2021-02-14 | 1 | -2/+4 |
| | | | | | | | | | The dot symbol matches any single character. When the dot symbol appears, the parser generates an AST matching all of the well-formed UTF-8 byte sequences. Refelences: * https://www.unicode.org/versions/Unicode13.0.0/ch03.pdf#G7404 * Table 3-6. UTF-8 Bit Distribution * Table 3-7. Well-Formed UTF-8 Byte Sequences | ||||
* | Add compiler | Ryo Nihei | 2021-02-14 | 1 | -0/+105 |
The compiler takes a lexical specification expressed by regular expressions and generates a DFA accepting the tokens. Operators that you can use in the regular expressions are concatenation, alternation, repeat, and grouping. |