0
I Use This!
Inactive

Commits : Listings

Analyzed about 17 hours ago. based on code collected about 20 hours ago.
May 01, 2023 — May 01, 2024
Commit Message Contributor Files Modified Lines Added Lines Removed Code Location Date
dump_grammar now emits .dot files for all RTNs! Also fixed some bugs with RTN emitting. More... over 16 years ago
output bytecode now contains all RTNs also. Everything is there but the decisions. More... over 16 years ago
added code to create minimal number of DFAs -- output bytecode shrunk from 1.4k to 0.4k! More... over 16 years ago
added code to detect what terminals cannot coexist in DFAs, because they conflict More... over 16 years ago
fixes for parse and dump_grammar (going to and from bytecode) and Makefile rule for generating pngs. More... over 16 years ago
add strings to bitcode file, and make dump_grammar use them More... over 16 years ago
added dump_grammar, which can take a bytecode file and dump its dfas to dot files More... over 16 years ago
can write intfas in Bitcode format that can be successfully read by llvm-bcanalyzer More... over 16 years ago
Add file documenting Bitcode file format. More... over 16 years ago
Add code that theoretically writes IntFAs to bitcode files. More... over 16 years ago
Initial version of bc_read_stream, for reading Bitcode files from C More... over 16 years ago
Small changes to language (renamed "ignore" to "allow") and checked in grammar files for JSON, regexes, and grammars. More... over 16 years ago
Can parse JSON! Code is very ugly, but that will change. More... over 16 years ago
Rudimentary lookahead calculation. More... almost 17 years ago
Deleting two more obselete sketches. More... almost 17 years ago
This code is ugly as sin, but it can successfully build a RTN. More... almost 17 years ago
Minimize algorithm from sketches is quite obsolete. More... almost 17 years ago
We're closer to building RTN's for the input grammars! More... almost 17 years ago
A major refactoring: the FA class is cleaner, and has subclasses for either integer-based automata (for lexing) or recursive transition networks (for parsing). The NFA-to-DFA and minimization routines were adapted to be agnostic to the difference. More... almost 17 years ago
Code to parse the grammar language. More... almost 17 years ago
Play around with comment styles a bit more, and move luaunit out of base dir. More... almost 17 years ago
Lots of comments and a little restructuring. More... almost 17 years ago
More bugfixes and a better serialize function. More... almost 17 years ago
Fix bugs related to backslash escaping and repetition. Also added proper support for the '.' wildcard. More... almost 17 years ago
Add unit tests for data structures and prune a bunch of unneeded methods from the data structures. More... almost 17 years ago
Ranges work and minimization works (using Hopcroft's algorithm)! More... almost 17 years ago
Major changes, mainly to support using ranges. Everything works but minimization. More... almost 17 years ago
Minimization is working! Albeit a really expensive algorithm. But it's a good first shot. More... almost 17 years ago
It now works significantly more. More... almost 17 years ago
a new regex parser, and a routine for combining several NFAs into an NFA that matches all simultaneously (remembering which of the NFAs matched). More... almost 17 years ago