Ryan Culpepper 3aa16f2c26 syntax/parse: speed up "is literal bound?" check ... Can't do check completely statically, because phase of comparison is expression (and even default is slightly unpredictable). So instead compute whether check would succeed for likely phase offsets, and use list of ok offsets as run-time fast path (memv instead of identifier-binding).		2011-09-06 12:41:03 -06:00
..
keywords.rkt
kws.rkt	Fixed syntax/parse bug:	2011-07-01 15:32:34 -04:00
lib.rkt
litconv.rkt	moved phase-of-enclosing-module to unstable/syntax	2011-06-10 13:22:33 -06:00
minimatch.rkt
parse.rkt	syntax/parse: syntax-parse sets current-syntax-context	2011-08-30 12:04:25 -06:00
rep-attrs.rkt	created racket/syntax from parts of unstable/syntax	2011-04-07 09:47:20 -06:00
rep-data.rkt	syntax/parse: added litset extension	2011-05-03 01:25:41 -06:00
rep-patterns.rkt	created racket/syntax from parts of unstable/syntax	2011-04-07 09:47:20 -06:00
rep.rkt	syntax/parse: speed up "is literal bound?" check	2011-09-06 12:41:03 -06:00
runtime-failure.rkt
runtime-progress.rkt
runtime-reflect.rkt
runtime-report.rkt
runtime.rkt	syntax/parse: speed up "is literal bound?" check	2011-09-06 12:41:03 -06:00
sc.rkt	syntax/parse: syntax-parse sets current-syntax-context	2011-08-30 12:04:25 -06:00
txlift.rkt