Sebastian Ullrich 134d27dbec feat(library/init/lean/parser/parsec): longest_match should return all longest parses ... In the case of overlapping notations, we will return a choice node of all possible parses.		2018-07-25 18:07:56 -07:00
..
reader	feat(library/init/lean/parser/parsec): longest_match should return all longest parses	2018-07-25 18:07:56 -07:00
identifier.lean	chore(library/init/lean/parser/parser_t): rename module and type to parsec to avoid nested use of parser	2018-07-12 10:35:20 +02:00
macro.lean	feat(library/init/lean/parser/macro): allow expanders to be skipped dynamically	2018-06-07 14:57:13 +02:00
parsec.lean	feat(library/init/lean/parser/parsec): longest_match should return all longest parses	2018-07-25 18:07:56 -07:00
string_literal.lean	chore(library/init/lean/parser/parser_t): rename module and type to parsec to avoid nested use of parser	2018-07-12 10:35:20 +02:00
syntax.lean	chore(library/init/lean/parser/parsec): proper namespacing	2018-07-12 10:35:22 +02:00