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

	Commit message (Collapse)	Author	Files	Lines
2021-03-07	Pass values in error type to panic()	Ryo Nihei	1	-2/+2
	Because parser.parse() expects that recover() returns a value in error type, apply this change.
2021-02-25	Refactoring	Ryo Nihei	5	-502/+351
	* Remove token field from symbolNode * Simplify notation of nested nodes * Simplify arguments of newSymbolNode()
2021-02-24	Add range expression	Ryo Nihei	4	-9/+977
	[a-z] matches any one character from a to z. The order of the characters depends on Unicode code points.
2021-02-20	Add + and ? operators	Ryo Nihei	6	-21/+117
	* a+ matches 'a' one or more times. This is equivalent to aa. a? matches 'a' zero or one time.
2021-02-17	Fix computation of last positions	Ryo Nihei	2	-0/+122

2021-02-16	Add logging to lex command	Ryo Nihei	3	-5/+126
	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.
2021-02-16	Add CLI	Ryo Nihei	6	-0/+433

2021-02-16	Add types of lexical specifications	Ryo Nihei	5	-90/+133
	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.
2021-02-14	Add bracket expression matching specified character	Ryo Nihei	4	-9/+127
	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.
2021-02-14	Add dot symbol matching any single character	Ryo Nihei	7	-21/+201
	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
2021-02-14	Add driver	Ryo Nihei	2	-0/+309
	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.
2021-02-14	Add compiler	Ryo Nihei	9	-0/+1268
	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.