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

	Commit message (Collapse)	Author	Age	Files	Lines
*	Change the lexical specs of regexp and define concrete syntax error values	Ryo Nihei	2021-04-17	5	-425/+568
\| \| \| \| \|	* Make the lexer treat ']' as an ordinary character in default mode * Define values of the syntax error type that represents error information concretely
*	Increase the maximum number of symbol positions per pattern	Ryo Nihei	2021-04-12	5	-29/+139
\| \| \| \| \|	This commit increases the maximum number of symbol positions per pattern to 2^15 (= 32,768). When the limit is exceeded, the parse method returns an error.
*	Fix grammar the parser accepts	Ryo Nihei	2021-04-11	6	-99/+1193
\| \| \| \| \|	* Add cases test the parse method. * Fix the parser to pass the cases.
*	Add logging to compile command	Ryo Nihei	2021-04-08	3	-47/+108
\| \| \| \| \|	compile command writes logs out to the maleeni-compile.log file. When you use compiler.Compile(), you can choose whether the lexer writes logs or not.
*	Add logical inverse expression	Ryo Nihei	2021-04-01	6	-34/+766
\| \| \| \|	[^a-z] matches any character that is not in the range a-z.
*	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	5	-502/+351
\| \| \| \| \| \|	* Remove token field from symbolNode * Simplify notation of nested nodes * Simplify arguments of newSymbolNode()
*	Add range expression	Ryo Nihei	2021-02-24	3	-8/+717
\| \| \| \|	[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	5	-16/+82
\| \| \| \| \|	* a+ matches 'a' one or more times. This is equivalent to aa. a? matches 'a' zero or one time.
*	Fix computation of last positions	Ryo Nihei	2021-02-17	2	-0/+122
\|
*	Add types of lexical specifications	Ryo Nihei	2021-02-16	2	-11/+27
\| \| \| \|	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.
*	Add bracket expression matching specified character	Ryo Nihei	2021-02-14	3	-9/+109
\| \| \| \|	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	6	-20/+158
\| \| \| \| \| \| \| \| \|	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	8	-0/+1265
	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.