tre - Unnamed repository; edit this file 'description' to name the repository.

	Commit message (Collapse)	Author	Age	Files	Lines
*	Pass values in error type to panic()	Ryo Nihei	2021-03-07	1	-2/+2
\| \| \| \|	Because parser.parse() expects that recover() returns a value in error type, apply this change.
*	Refactoring	Ryo Nihei	2021-02-25	1	-449/+301
\| \| \| \| \| \|	* Remove token field from symbolNode * Simplify notation of nested nodes * Simplify arguments of newSymbolNode()
*	Add range expression	Ryo Nihei	2021-02-24	1	-4/+705
\| \| \| \|	[a-z] matches any one character from a to z. The order of the characters depends on Unicode code points.
*	Add + and ? operators	Ryo Nihei	2021-02-20	1	-3/+9
\| \| \| \| \|	* a+ matches 'a' one or more times. This is equivalent to aa. a? matches 'a' zero or one time.
*	Add bracket expression matching specified character	Ryo Nihei	2021-02-14	1	-6/+25
\| \| \| \|	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.
*	Add dot symbol matching any single character	Ryo Nihei	2021-02-14	1	-3/+104
\| \| \| \| \| \| \| \| \|	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/+221
	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.