projects / mit-scheme.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 5a6eb16) | patch
Change NFS nodes to have a clearer set of types.
authorChris Hanson <org/chris-hanson/cph>
Sat, 30 Nov 2019 06:01:48 +0000 (22:01 -0800)
committerChris Hanson <org/chris-hanson/cph>
Sat, 30 Nov 2019 06:01:48 +0000 (22:01 -0800)
commit2994a7b4e9e5b58eae6cbf9e00cddba08e6e329e
tree140474a171502fae95930bae967ee14d81dd7315tree | snapshot
parent5a6eb167435c3e6eb72e5f8281bd31dbcea1479bcommit | diff
Change NFS nodes to have a clearer set of types.

This also allows more detailed analysis of the graph: we can now write a program
that will determine the initial character(s) of a regexp and use that to speed
up search.
src/runtime/regexp-nfa.scm diff | blob | history
src/runtime/srfi-115.scm diff | blob | history
MIT/GNU Scheme, Pucked