| Give in to the insanity, and rename the licence file to LICENSE, in line with Paket defaults, and the prevailing (wrong) spelling hegemony. |
|
More...
|
over 8 years ago
|
| Merge branch 'fix-travis' |
|
More...
|
almost 9 years ago
|
| Update Travis build definitions. |
|
More...
|
almost 9 years ago
|
| x and xs aren't very descriptive names. |
|
More...
|
almost 9 years ago
|
| Merge pull request #9 from frankshearar/simplify-compact |
|
More...
|
about 10 years ago
|
| Remove debug logging. |
|
More...
|
about 10 years ago
|
| Don't name that which is unused. |
|
More...
|
about 10 years ago
|
| Separate compaction's function application from recursion. Redefine the top level compact function as the application of this compactFn over a parser. |
|
More...
|
about 10 years ago
|
| Possible we can make d, dP more like functions applied by map, and separate out their commonality (to highlight their sole difference...? |
|
More...
|
about 10 years ago
|
| Move the two derivative functions next to each other. Easier to tell the difference between the two. |
|
More...
|
about 10 years ago
|
| Simplify postfixWalk/compact. |
|
More...
|
about 10 years ago
|
| Merge pull request #8 from frankshearar/gen-2 |
|
More...
|
over 10 years ago
|
| Using a List speeds up generation about 80-fold. Kill the old implementation completely. |
|
More...
|
over 10 years ago
|
| Line endings for string literals seem to vary depending on platform. Let's try be very specific about line endings. |
|
More...
|
over 10 years ago
|
| Remove the ridiculous double fold. Ignore the test because it's a) open ended and b) causes stack overflows in CI (because of generated data, not bugs). |
|
More...
|
over 10 years ago
|
| Oops: this is a regular parser, not a context free parser. |
|
More...
|
over 10 years ago
|
| Push start/final state tracking into NFA<'a>. |
|
More...
|
over 10 years ago
|
| Checkpoint |
|
More...
|
over 10 years ago
|
| Gracefully handle complicated parsers that are, when compacted, Empty/Eps/Eps', when transforming to NFA. |
|
More...
|
over 10 years ago
|
| With the paths in reverse order, we no longer need to explicitly remember the focus/current node. |
|
More...
|
over 10 years ago
|
| Generate strings by converting a Parser to an NFA, and then enumerating the paths through the NFA with a breadth-first search. |
|
More...
|
over 10 years ago
|
| The Power Tools don't like me declaring x (as alias to this) without using it. __ keeps it quiet. |
|
More...
|
over 10 years ago
|
| Record a possible bug in the original paper. |
|
More...
|
over 10 years ago
|
| Removing the type means the compiler can inline. Finally get a recursive definition working. |
|
More...
|
over 10 years ago
|
| Interim commit. Doesn't compile. |
|
More...
|
over 10 years ago
|
| Obey the Power Tools' suggestion that we use _ for unused declarations. |
|
More...
|
over 10 years ago
|
| Now we can create NuGet packages from the build script. |
|
More...
|
over 11 years ago
|
| MatchString didn't buy us much. |
|
More...
|
over 11 years ago
|
| The Fred project does not depend on anything other than standard CLR libs. |
|
More...
|
over 11 years ago
|
| compact works, and we use it in resumableFind, so let's use it in matches too. |
|
More...
|
over 11 years ago
|
