| Commit message (Expand) | Author | Files | Lines |
|---|
| 2021-02-17 | Fix computation of last positions | Ryo Nihei | 2 | -0/+122 |
| 2021-02-16 | Add logging to lex command•••lex command writes logs out to the maleeni-lex.log file.
When you generate a lexer using driver.NewLexer(), you can choose whether the lexer writes logs or not.
| Ryo Nihei | 3 | -5/+126 |
| 2021-02-16 | Add CLI | Ryo Nihei | 6 | -0/+433 |
| 2021-02-16 | Add types of lexical specifications•••APIs of compiler and driver packages use these types. Because CompiledLexSpec struct a lexer takes has kind names of lexical specification entries, the lexer sets them to tokens.
| Ryo Nihei | 5 | -90/+133 |
| 2021-02-14 | Add bracket expression matching specified character•••The bracket expression matches any single character specified in it. In the bracket expression, the special characters like ., *, and so on are also handled as normal characters.
| Ryo Nihei | 4 | -9/+127 |
| 2021-02-14 | Add dot symbol matching any single character•••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
| Ryo Nihei | 7 | -21/+201 |
| 2021-02-14 | Add driver•••The driver takes a DFA and an input text and generates a lexer. The lexer tokenizes the input text according to the lexical specification that the DFA expresses.
| Ryo Nihei | 2 | -0/+309 |
| 2021-02-14 | Add compiler•••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.
| Ryo Nihei | 9 | -0/+1268 |
