The one-more-re-nightmare Reference Manual

Child Components

package.lisp (file).
dfa-construction (module).
compiler (module).
interface (module).

3 Modules

Modules are listed depth-first from the system components tree.

one-more-re-nightmare/DFA-construction
one-more-re-nightmare/Compiler
one-more-re-nightmare/Interface

3.1 `one-more-re-nightmare/DFA-construction`

Dependency

package.lisp (file).

Source

Parent Component

one-more-re-nightmare (system).

Child Components

type.lisp (file).
sets.lisp (file).
re-types.lisp (file).
nullable.lisp (file).
derivative.lisp (file).
derivative-classes.lisp (file).
empty.lisp (file).
effects.lisp (file).
similar.lisp (file).
tag-sets.lisp (file).
make-dfa.lisp (file).

3.2 `one-more-re-nightmare/Compiler`

Dependency

dfa-construction (module).

Source

Parent Component

one-more-re-nightmare (system).

Child Components

layout.lisp (file).
compilation-strategy.lisp (file).
length-inference.lisp (file).
optimize-settings.lisp (file).
code-generation.lisp (file).

3.3 `one-more-re-nightmare/Interface`

Dependency

compiler (module).

Source

Parent Component

one-more-re-nightmare (system).

Child Components

syntax.lisp (file).
convert-to-bytes.lisp (file).
code-cache.lisp (file).
lint.lisp (file).
interface.lisp (file).

4 Files

Files are sorted by type and then listed depth-first from the systems components trees.

Lisp

4.1.3 `one-more-re-nightmare/DFA-construction/type.lisp`

Source

Parent Component

dfa-construction (module).

Internals

*table-names* (special variable).
+uncomputed+ (constant).
cached-has-tags-p (reader method).
(setf cached-has-tags-p) (writer method).
cached-nullable (reader method).
(setf cached-nullable) (writer method).
cached-nullable-no-gensym (reader method).
(setf cached-nullable-no-gensym) (writer method).
cached-removed-tags (reader method).
(setf cached-removed-tags) (writer method).
cached-tags (reader method).
(setf cached-tags) (writer method).
cached-used-tags (reader method).
(setf cached-used-tags) (writer method).
clear-global-tables (macro).
define-hash-consing-table (macro).
define-rewrites (macro).
define-types (macro).
regular-expression (class).
with-hash-consing (macro).
with-hash-consing-tables (macro).
with-slot-consing (macro).

4.1.4 `one-more-re-nightmare/DFA-construction/sets.lisp`

Source

Parent Component

dfa-construction (module).

Internals

+empty-set+ (constant).
+universal-set+ (constant).
fold-or (function).
isum-case (macro).
isum-op (macro).
make-test-form (function).
print-isum (function).
set-intersection (function).
set-inverse (function).
set-null (function).
set-union (function).
singleton-set (function).
symbol-range (function).
symbol-set (function).
symbol-set-difference (function).

4.1.5 `one-more-re-nightmare/DFA-construction/re-types.lisp`

Source

Parent Component

dfa-construction (module).

Public Interface

print-object (method).
print-object (method).
print-object (method).
print-object (method).
print-object (method).
print-object (method).
print-object (method).
print-object (method).
print-object (method).
print-object (method).

Internals

%alpha (function).
%both (function).
%either (function).
%empty-string (function).
%grep (function).
%invert (function).
%join (function).
%literal (function).
%repeat (function).
%tag-set (function).
*alpha-table* (special variable).
*both-table* (special variable).
*either-table* (special variable).
*empty-string-table* (special variable).
*grep-table* (special variable).
*invert-table* (special variable).
*join-table* (special variable).
*literal-table* (special variable).
*repeat-table* (special variable).
*subscripts* (special variable).
*tag-set-table* (special variable).
alpha (function).
alpha (class).
both (function).
both (class).
either (function).
either (class).
empty-set (function).
empty-string (function).
empty-string (class).
grep (function).
grep (class).
group (function).
invert (function).
invert (class).
join (function).
join (class).
kleene (function).
literal (function).
literal (class).
repeat (function).
repeat (class).
scan-either-for-duplicates (function).
subscripts (function).
tag-set (function).
tag-set (class).
text (function).
universal-set (function).

4.1.6 `one-more-re-nightmare/DFA-construction/nullable.lisp`

Source

Parent Component

dfa-construction (module).

Internals

*gensym-assignments?* (special variable).
cached-nullable* (function).
(setf cached-nullable*) (function).
nullable (function).

4.1.7 `one-more-re-nightmare/DFA-construction/derivative.lisp`

Source

Parent Component

dfa-construction (module).

Internals

*derivative* (special variable).
derivative (function).
derivative* (function).

4.1.8 `one-more-re-nightmare/DFA-construction/derivative-classes.lisp`

Source

Parent Component

dfa-construction (module).

Internals

*derivative-classes* (special variable).
derivative-classes (function).
merge-sets (function).

4.1.9 `one-more-re-nightmare/DFA-construction/empty.lisp`

Source: one-more-re-nightmare.asd.
Parent Component: dfa-construction (module).
Internals: re-empty-p (function).

4.1.10 `one-more-re-nightmare/DFA-construction/effects.lisp`

Source

Parent Component

dfa-construction (module).

Internals

effects (function).
has-literals-p (function).

4.1.11 `one-more-re-nightmare/DFA-construction/similar.lisp`

Source

Parent Component

dfa-construction (module).

Internals

%similar (function).
*backward-environment* (special variable).
*environment* (special variable).
assert-equivalent (function).
assert-equivalent-sources (function).
no-match (condition).
similar (function).

4.1.12 `one-more-re-nightmare/DFA-construction/tag-sets.lisp`

Source

Parent Component

dfa-construction (module).

Internals

*allow-alpha* (special variable).
*tag-gensym-counter* (special variable).
gensym-position-assignments (function).
has-tags-p (function).
keep-used-assignments (function).
map-tags (function).
merge-tag-sets (function).
remove-tags (function).
tag-gensym (function).
tags (function).
unique-assignments (function).
unique-tags (function).
used-tags (function).

4.1.13 `one-more-re-nightmare/DFA-construction/make-dfa.lisp`

Source

Parent Component

dfa-construction (module).

Public Interface

print-object (method).

Internals

*probably-bad-limit* (special variable).
add-transition (function).
copy-transition (function).
find-similar-state (function).
make-dfa-from-expression (function).
make-dfa-from-expressions (function).
make-transition (function).
peephole-optimize (function).
re-stopped-p (function).
state (class).
state-exit-effects (reader method).
(setf state-exit-effects) (writer method).
state-exit-map (reader method).
(setf state-exit-map) (writer method).
state-expression (reader method).
(setf state-expression) (writer method).
state-transitions (reader method).
(setf state-transitions) (writer method).
transition (structure).
transition-class (reader).
(setf transition-class) (writer).
transition-next-state (reader).
(setf transition-next-state) (writer).
transition-p (function).
transition-tags-to-set (reader).
(setf transition-tags-to-set) (writer).

4.1.14 `one-more-re-nightmare/Compiler/layout.lisp`

Source

Parent Component

compiler (module).

Internals

*default-layout* (special variable).
copy-layout (function).
layout (structure).
layout-array-type (reader).
(setf layout-array-type) (writer).
layout-equal (reader).
(setf layout-equal) (writer).
layout-from-number (reader).
(setf layout-from-number) (writer).
layout-less (reader).
(setf layout-less) (writer).
layout-less-or-equal (reader).
(setf layout-less-or-equal) (writer).
layout-p (function).
layout-ref (reader).
(setf layout-ref) (writer).
layout-to-number (reader).
(setf layout-to-number) (writer).
make-layout (function).

4.1.15 `one-more-re-nightmare/Compiler/compilation-strategy.lisp`

Source

Parent Component

compiler (module).

Internals

*compiler-state* (special variable).
*layout* (special variable).
add-tags (function).
call-continuation (class).
declarations (generic function).
initial-states (generic function).
lambda-list (generic function).
macros-for-strategy (generic function).
make-default-strategy (function).
make-search-machine (function).
scan-everything (class).
start-code (generic function).
strategy (class).
transition-code (generic function).

4.1.16 `one-more-re-nightmare/Compiler/length-inference.lisp`

Source

Parent Component

compiler (module).

Internals

compute-minimum-lengths (function).
compute-predecessor-lists (function).
length-inference-info (class).
minimum-length (reader method).
(setf minimum-length) (writer method).
predecessors (reader method).
(setf predecessors) (writer method).
state-never-succeeds-p (function).

4.1.17 `one-more-re-nightmare/Compiler/optimize-settings.lisp`

Source

Parent Component

compiler (module).

Internals

*optimize-settings* (special variable).
with-naughty-compiler-switches (macro).

4.1.18 `one-more-re-nightmare/Compiler/code-generation.lisp`

Source

Parent Component

compiler (module).

Internals

%compile-regular-expression (function).
*code-type* (special variable).
*nowhere* (special variable).
compiler-state (class).
find-in-map (function).
find-state-name (function).
find-variable-name (function).
make-body-from-dfa (function).
make-lambda-form (function).
make-prog-parts (generic function).
match-vector-size (function).
next-state-name (reader method).
(setf next-state-name) (writer method).
setf-from-assignments (function).
start-code (method).
start-code (method).
state-names (reader method).
transition-code (method).
variable-map (reader method).
variable-map-from-groups (function).
variable-names (reader method).
win-locations (function).

4.1.19 `one-more-re-nightmare/Interface/syntax.lisp`

Source

Parent Component

interface (module).

Internals

*group-strings* (special variable).
*next-group* (special variable).
clear-registers (function).
next-group (function).
parse-regular-expression (function).

4.1.20 `one-more-re-nightmare/Interface/convert-to-bytes.lisp`

Source: one-more-re-nightmare.asd.
Parent Component: interface (module).

4.1.21 `one-more-re-nightmare/Interface/code-cache.lisp`

Source

Parent Component

interface (module).

Public Interface

compile-regular-expression (function).
compiled-regular-expression (structure).
print-object (method).

Internals

*code-cache* (special variable).
*code-lock* (special variable).
*string-types* (special variable).
*type-dispatcher* (special variable).
compiled-regular-expression-p (function).
copy-compiled-regular-expression (function).
cre-codes (reader).
(setf cre-codes) (writer).
cre-original-re (reader).
(setf cre-original-re) (writer).
find-code (function).
make-compiled-regular-expression (function).
string-type-of (function).

4.1.22 `one-more-re-nightmare/Interface/lint.lisp`

Source

Parent Component

interface (module).

Public Interface

lint-style-warning (condition).
matching-too-much-style-warning (condition).
not-matchable-style-warning (condition).

Internals

check-empty-matches (function).
check-liveness (function).
expression-matches-empty-string (condition).
expression-matches-everything (condition).
expression-not-matchable (condition).
group-not-matchable (condition).
lint-regular-expression (function).
warning-group-number (reader method).
warning-group-string (reader method).

4.1.23 `one-more-re-nightmare/Interface/interface.lisp`

Source

Parent Component

interface (module).

Public Interface

all-matches (compiler macro).
all-matches (function).
all-string-matches (compiler macro).
all-string-matches (function).
compile-regular-expression (compiler macro).
do-matches (macro).
first-match (compiler macro).
first-match (function).
first-string-match (compiler macro).
first-string-match (function).

Internals

%all-matches (function).
%first-match (function).
collect (macro).
constant-safe-to-eval-p (function).
re-groups (function).
subsequences (function).
try-to-evaluate-constant-re (function).
with-code (macro).
with-code-for-vector (macro).

5 Packages

Packages are listed by definition order.

one-more-re-nightmare

5.1 `one-more-re-nightmare`

Source

package.lisp.

Use List

common-lisp.

Public Interface

all-matches (compiler macro).
all-matches (function).
all-string-matches (compiler macro).
all-string-matches (function).
compile-regular-expression (compiler macro).
compile-regular-expression (function).
compiled-regular-expression (structure).
do-matches (macro).
first-match (compiler macro).
first-match (function).
first-string-match (compiler macro).
first-string-match (function).
lint-style-warning (condition).
matching-too-much-style-warning (condition).
not-matchable-style-warning (condition).

Internals

%all-matches (function).
%alpha (function).
%both (function).
%compile-regular-expression (function).
%either (function).
%empty-string (function).
%first-match (function).
%grep (function).
%invert (function).
%join (function).
%literal (function).
%repeat (function).
%similar (function).
%tag-set (function).
*allow-alpha* (special variable).
*alpha-table* (special variable).
*backward-environment* (special variable).
*both-table* (special variable).
*code-cache* (special variable).
*code-lock* (special variable).
*code-type* (special variable).
*compiler-state* (special variable).
*default-layout* (special variable).
*derivative* (special variable).
*derivative-classes* (special variable).
*either-table* (special variable).
*empty-string-table* (special variable).
*environment* (special variable).
*gensym-assignments?* (special variable).
*grep-table* (special variable).
*group-strings* (special variable).
*invert-table* (special variable).
*join-table* (special variable).
*layout* (special variable).
*literal-table* (special variable).
*next-group* (special variable).
*nowhere* (special variable).
*optimize-settings* (special variable).
*probably-bad-limit* (special variable).
*repeat-table* (special variable).
*string-types* (special variable).
*subscripts* (special variable).
*table-names* (special variable).
*tag-gensym-counter* (special variable).
*tag-set-table* (special variable).
*type-dispatcher* (special variable).
+empty-set+ (constant).
+uncomputed+ (constant).
+universal-set+ (constant).
add-tags (function).
add-transition (function).
alpha (function).
alpha (class).
assert-equivalent (function).
assert-equivalent-sources (function).
both (function).
both (class).
cached-has-tags-p (generic reader).
(setf cached-has-tags-p) (generic writer).
cached-nullable (generic reader).
(setf cached-nullable) (generic writer).
cached-nullable* (function).
(setf cached-nullable*) (function).
cached-nullable-no-gensym (generic reader).
(setf cached-nullable-no-gensym) (generic writer).
cached-removed-tags (generic reader).
(setf cached-removed-tags) (generic writer).
cached-tags (generic reader).
(setf cached-tags) (generic writer).
cached-used-tags (generic reader).
(setf cached-used-tags) (generic writer).
call-continuation (class).
check-empty-matches (function).
check-liveness (function).
clear-global-tables (macro).
clear-registers (function).
collect (macro).
compiled-regular-expression-p (function).
compiler-state (class).
compute-minimum-lengths (function).
compute-predecessor-lists (function).
constant-safe-to-eval-p (function).
copy-compiled-regular-expression (function).
copy-layout (function).
copy-transition (function).
cre-codes (reader).
(setf cre-codes) (writer).
cre-original-re (reader).
(setf cre-original-re) (writer).
declarations (generic function).
define-hash-consing-table (macro).
define-rewrites (macro).
define-types (macro).
derivative (function).
derivative* (function).
derivative-classes (function).
effects (function).
either (function).
either (class).
empty-set (function).
empty-string (function).
empty-string (class).
expression-matches-empty-string (condition).
expression-matches-everything (condition).
expression-not-matchable (condition).
find-code (function).
find-in-map (function).
find-similar-state (function).
find-state-name (function).
find-variable-name (function).
fold-or (function).
gensym-position-assignments (function).
grep (function).
grep (class).
group (function).
group-not-matchable (condition).
has-literals-p (function).
has-tags-p (function).
initial-states (generic function).
invert (function).
invert (class).
isum-case (macro).
isum-op (macro).
join (function).
join (class).
keep-used-assignments (function).
kleene (function).
lambda-list (generic function).
layout (structure).
layout-array-type (reader).
(setf layout-array-type) (writer).
layout-equal (reader).
(setf layout-equal) (writer).
layout-from-number (reader).
(setf layout-from-number) (writer).
layout-less (reader).
(setf layout-less) (writer).
layout-less-or-equal (reader).
(setf layout-less-or-equal) (writer).
layout-p (function).
layout-ref (reader).
(setf layout-ref) (writer).
layout-to-number (reader).
(setf layout-to-number) (writer).
length-inference-info (class).
lint-regular-expression (function).
literal (function).
literal (class).
macros-for-strategy (generic function).
make-body-from-dfa (function).
make-compiled-regular-expression (function).
make-default-strategy (function).
make-dfa-from-expression (function).
make-dfa-from-expressions (function).
make-lambda-form (function).
make-layout (function).
make-prog-parts (generic function).
make-search-machine (function).
make-test-form (function).
make-transition (function).
map-tags (function).
match-vector-size (function).
merge-sets (function).
merge-tag-sets (function).
minimum-length (generic reader).
(setf minimum-length) (generic writer).
next-group (function).
next-state-name (generic reader).
(setf next-state-name) (generic writer).
no-match (condition).
nullable (function).
parse-regular-expression (function).
peephole-optimize (function).
predecessors (generic reader).
(setf predecessors) (generic writer).
print-isum (function).
re-empty-p (function).
re-groups (function).
re-stopped-p (function).
regular-expression (class).
remove-tags (function).
repeat (function).
repeat (class).
scan-either-for-duplicates (function).
scan-everything (class).
set-intersection (function).
set-inverse (function).
set-null (function).
set-union (function).
setf-from-assignments (function).
similar (function).
singleton-set (function).
start-code (generic function).
state (class).
state-exit-effects (generic reader).
(setf state-exit-effects) (generic writer).
state-exit-map (generic reader).
(setf state-exit-map) (generic writer).
state-expression (generic reader).
(setf state-expression) (generic writer).
state-names (generic reader).
state-never-succeeds-p (function).
state-transitions (generic reader).
(setf state-transitions) (generic writer).
strategy (class).
string-type-of (function).
subscripts (function).
subsequences (function).
symbol-range (function).
symbol-set (function).
symbol-set-difference (function).
tag-gensym (function).
tag-set (function).
tag-set (class).
tags (function).
text (function).
transition (structure).
transition-class (reader).
(setf transition-class) (writer).
transition-code (generic function).
transition-next-state (reader).
(setf transition-next-state) (writer).
transition-p (function).
transition-tags-to-set (reader).
(setf transition-tags-to-set) (writer).
try-to-evaluate-constant-re (function).
unique-assignments (function).
unique-tags (function).
universal-set (function).
used-tags (function).
variable-map (generic reader).
variable-map-from-groups (function).
variable-names (generic reader).
warning-group-number (generic reader).
warning-group-string (generic reader).
win-locations (function).
with-code (macro).
with-code-for-vector (macro).
with-hash-consing (macro).
with-hash-consing-tables (macro).
with-naughty-compiler-switches (macro).
with-slot-consing (macro).

6 Definitions

Definitions are sorted by export status, category, package, and then by lexicographic order.

Public Interface
Internals

6.1.1 Macros

Macro: do-matches (((&rest registers) regular-expression vector &key start end) &body body) ¶

Iterate over every match, binding match registers.

Package: one-more-re-nightmare.
Source: interface.lisp.

6.1.2 Compiler macros

Compiler Macro: all-matches (regular-expression vector &key start end) ¶

Package: one-more-re-nightmare.
Source: interface.lisp.

Compiler Macro: all-string-matches (regular-expression vector &key start end) ¶

Package: one-more-re-nightmare.
Source: interface.lisp.

Compiler Macro: compile-regular-expression (expression) ¶

Package: one-more-re-nightmare.
Source: interface.lisp.

Compiler Macro: first-match (regular-expression vector &key start end) ¶

Package: one-more-re-nightmare.
Source: interface.lisp.

Compiler Macro: first-string-match (regular-expression vector &key start end) ¶

Package: one-more-re-nightmare.
Source: interface.lisp.

6.1.3 Ordinary functions

Function: all-matches (regular-expression vector &key start end) ¶

Find every match, as a list of match vectors.

Package: one-more-re-nightmare.
Source: interface.lisp.

Function: all-string-matches (regular-expression vector &key start end) ¶

Find every match, as a list of match string vectors.

Package: one-more-re-nightmare.
Source: interface.lisp.

Function: compile-regular-expression (expression) ¶

Package: one-more-re-nightmare.
Source: code-cache.lisp.

Function: first-match (regular-expression vector &key start end) ¶

Find the first match, returning a match vector, or NIL.

Package: one-more-re-nightmare.
Source: interface.lisp.

Function: first-string-match (regular-expression vector &key start end) ¶

Find the first match, returning a match string vector or NIL

Package: one-more-re-nightmare.
Source: interface.lisp.

6.1.4 Standalone methods

Method: print-object ((cre compiled-regular-expression) stream) ¶

Source: code-cache.lisp.

Method: print-object ((instance join) stream) ¶

Source: re-types.lisp.

Method: print-object ((instance empty-string) stream) ¶

Source: re-types.lisp.

Method: print-object ((instance repeat) stream) ¶

Source: re-types.lisp.

Method: print-object ((instance literal) stream) ¶

Source: re-types.lisp.

Method: print-object ((instance alpha) stream) ¶

Source: re-types.lisp.

Method: print-object ((state state) stream) ¶

Source: make-dfa.lisp.

Method: print-object ((instance grep) stream) ¶

Source: re-types.lisp.

Method: print-object ((instance tag-set) stream) ¶

Source: re-types.lisp.

Method: print-object ((instance invert) stream) ¶

Source: re-types.lisp.

Method: print-object ((instance either) stream) ¶

Source: re-types.lisp.

Method: print-object ((instance both) stream) ¶

Source: re-types.lisp.

6.1.5 Conditions

Condition: lint-style-warning ¶

Package

Source

Direct superclasses

style-warning.

Direct subclasses

matching-too-much-style-warning.
not-matchable-style-warning.

Condition: matching-too-much-style-warning ¶

Package

Source

Direct superclasses

lint-style-warning.

Direct subclasses

expression-matches-empty-string.
expression-matches-everything.

Condition: not-matchable-style-warning ¶

Package

Source

Direct superclasses

lint-style-warning.

Direct subclasses

expression-not-matchable.
group-not-matchable.

6.1.6 Structures

Structure: compiled-regular-expression ¶

Package

Source

code-cache.lisp.

Direct superclasses

structure-object.

Direct methods

Direct slots

Slot: codes ¶

Type: simple-vector
Initform: (alexandria:required-argument)
Readers: cre-codes.
Writers: (setf cre-codes).

Slot: original-re ¶

Readers: cre-original-re.
Writers: (setf cre-original-re).

6.2 Internals

Constants
Special variables
Macros
Ordinary functions
Generic functions
Conditions
Structures
Classes

6.2.1 Constants

Constant: +empty-set+ ¶

Package: one-more-re-nightmare.
Source: sets.lisp.

Constant: +uncomputed+ ¶

Package: one-more-re-nightmare.
Source: type.lisp.

Constant: +universal-set+ ¶

Package: one-more-re-nightmare.
Source: sets.lisp.

6.2.2 Special variables

Special Variable: *allow-alpha* ¶

Package: one-more-re-nightmare.
Source: tag-sets.lisp.

Special Variable: *alpha-table* ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Special Variable: *backward-environment* ¶

Package: one-more-re-nightmare.
Source: similar.lisp.

Special Variable: *both-table* ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Special Variable: *code-cache* ¶

Package: one-more-re-nightmare.
Source: code-cache.lisp.

Special Variable: *code-lock* ¶

Package: one-more-re-nightmare.
Source: code-cache.lisp.

Special Variable: *code-type* ¶

Package: one-more-re-nightmare.
Source: code-generation.lisp.

Special Variable: *compiler-state* ¶

Package: one-more-re-nightmare.
Source: compilation-strategy.lisp.

Special Variable: *default-layout* ¶

Package: one-more-re-nightmare.
Source: layout.lisp.

Special Variable: *derivative* ¶

Package: one-more-re-nightmare.
Source: derivative.lisp.

Special Variable: *derivative-classes* ¶

Package: one-more-re-nightmare.
Source: derivative-classes.lisp.

Special Variable: *either-table* ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Special Variable: *empty-string-table* ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Special Variable: *environment* ¶

Package: one-more-re-nightmare.
Source: similar.lisp.

Special Variable: *gensym-assignments?* ¶

Package: one-more-re-nightmare.
Source: nullable.lisp.

Special Variable: *grep-table* ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Special Variable: *group-strings* ¶

Package: one-more-re-nightmare.
Source: syntax.lisp.

Special Variable: *invert-table* ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Special Variable: *join-table* ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Special Variable: *layout* ¶

Package: one-more-re-nightmare.
Source: compilation-strategy.lisp.

Special Variable: *literal-table* ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Special Variable: *next-group* ¶

Package: one-more-re-nightmare.
Source: syntax.lisp.

Special Variable: *nowhere* ¶

Package: one-more-re-nightmare.
Source: code-generation.lisp.

Special Variable: *optimize-settings* ¶

Package: one-more-re-nightmare.
Source: optimize-settings.lisp.

Special Variable: *probably-bad-limit* ¶

Package: one-more-re-nightmare.
Source: make-dfa.lisp.

Special Variable: *repeat-table* ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Special Variable: *string-types* ¶

Package: one-more-re-nightmare.
Source: code-cache.lisp.

Special Variable: *subscripts* ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Special Variable: *table-names* ¶

Package: one-more-re-nightmare.
Source: type.lisp.

Special Variable: *tag-gensym-counter* ¶

Package: one-more-re-nightmare.
Source: tag-sets.lisp.

Special Variable: *tag-set-table* ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Special Variable: *type-dispatcher* ¶

Package: one-more-re-nightmare.
Source: code-cache.lisp.

6.2.3 Macros

Macro: clear-global-tables () ¶

Set up global tables for testing.

Package: one-more-re-nightmare.
Source: type.lisp.

Macro: collect ((function) &body body) ¶

Package: one-more-re-nightmare.
Source: interface.lisp.

Macro: define-hash-consing-table (name) ¶

Package: one-more-re-nightmare.
Source: type.lisp.

Macro: define-rewrites ((name &rest slots) &key simplify hash-cons printer) ¶

Package: one-more-re-nightmare.
Source: type.lisp.

Macro: define-types (&body types) ¶

Package: one-more-re-nightmare.
Source: type.lisp.

Macro: isum-case (var less-than equal &body clauses) ¶

Package: one-more-re-nightmare.
Source: sets.lisp.

Macro: isum-op (op a b) ¶

Combine the sets A and B by the Boolean operator op, which should be a
valid argument to the BOOLE function. An integer x is member of the
resulting set iff
(logbitp 0 (boole op (if (isum-member x A) 1 0) (if (isum-member x B) 1 0))) is non-NIL. That way e.g. boole-ior denotes the union.

Package: one-more-re-nightmare.
Source: sets.lisp.

Macro: with-code (((function size) code) &body body) ¶

Package: one-more-re-nightmare.
Source: interface.lisp.

Macro: with-code-for-vector ((function size vector regular-expression bailout-form) &body body) ¶

Package: one-more-re-nightmare.
Source: interface.lisp.

Macro: with-hash-consing ((table key) &body body) ¶

Package: one-more-re-nightmare.
Source: type.lisp.

Macro: with-hash-consing-tables (() &body body) ¶

Package: one-more-re-nightmare.
Source: type.lisp.

Macro: with-naughty-compiler-switches (() &body body) ¶

Package: one-more-re-nightmare.
Source: optimize-settings.lisp.

Macro: with-slot-consing ((accessor object &key when) &body body) ¶

Package: one-more-re-nightmare.
Source: type.lisp.

6.2.4 Ordinary functions

Function: %all-matches (function size vector start end) ¶

Package: one-more-re-nightmare.
Source: interface.lisp.

Function: %alpha (expression history) ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: %both (r s) ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: %compile-regular-expression (expression &key layout strategy) ¶

Package: one-more-re-nightmare.
Source: code-generation.lisp.

Function: %either (r s) ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: %empty-string () ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: %first-match (function size vector start end) ¶

Package: one-more-re-nightmare.
Source: interface.lisp.

Function: %grep (vector prototype) ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: %invert (r) ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: %join (r s) ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: %literal (set) ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: %repeat (r min max can-empty) ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: %similar (from to) ¶

Package: one-more-re-nightmare.
Source: similar.lisp.

Function: %tag-set (substitutions) ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: add-tags (expression) ¶

Package: one-more-re-nightmare.
Source: compilation-strategy.lisp.

Function: add-transition (class last-state next-state tags-to-set) ¶

Package: one-more-re-nightmare.
Source: make-dfa.lisp.

Function: alpha (expression history) ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: assert-equivalent (from to) ¶

Package: one-more-re-nightmare.
Source: similar.lisp.

Function: assert-equivalent-sources (from to) ¶

Ensure that we don’t unify POSITION and a variable, or two different variables.

Package: one-more-re-nightmare.
Source: similar.lisp.

Function: both (r s) ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: cached-nullable* (re) ¶

Package: one-more-re-nightmare.
Source: nullable.lisp.

Function: (setf cached-nullable*) (re) ¶

Package: one-more-re-nightmare.
Source: nullable.lisp.

Function: check-empty-matches (dfa) ¶

Package: one-more-re-nightmare.
Source: lint.lisp.

Function: check-liveness (dfa groups group-strings) ¶

Package: one-more-re-nightmare.
Source: lint.lisp.

Function: clear-registers (expression) ¶

Package: one-more-re-nightmare.
Source: syntax.lisp.

Function: compiled-regular-expression-p (object) ¶

Package: one-more-re-nightmare.
Source: code-cache.lisp.

Function: compute-minimum-lengths (states) ¶

Package: one-more-re-nightmare.
Source: length-inference.lisp.

Function: compute-predecessor-lists (states) ¶

Package: one-more-re-nightmare.
Source: length-inference.lisp.

Function: constant-safe-to-eval-p (form) ¶

Package: one-more-re-nightmare.
Source: interface.lisp.

Function: copy-compiled-regular-expression (instance) ¶

Package: one-more-re-nightmare.
Source: code-cache.lisp.

Function: copy-layout (instance) ¶

Package: one-more-re-nightmare.
Source: layout.lisp.

Function: copy-transition (instance) ¶

Package: one-more-re-nightmare.
Source: make-dfa.lisp.

Reader: cre-codes (instance) ¶

Writer: (setf cre-codes) (instance) ¶

Package: one-more-re-nightmare.
Source: code-cache.lisp.
Target Slot: codes.

Reader: cre-original-re (instance) ¶

Writer: (setf cre-original-re) (instance) ¶

Package: one-more-re-nightmare.
Source: code-cache.lisp.
Target Slot: original-re.

Function: derivative (re set) ¶

Compute the derivative of a regular expression with regards to the set (i.e. the regular expression should be matched after a character in the set is matched).

Package: one-more-re-nightmare.
Source: derivative.lisp.

Function: derivative* (re sequence &key search) ¶

Package: one-more-re-nightmare.
Source: derivative.lisp.

Function: derivative-classes (re) ¶

Produce a list of the ’classes’ (sets) of characters that compiling the regular expression would have to dispatch on.

Package: one-more-re-nightmare.
Source: derivative-classes.lisp.

Function: effects (re) ¶

Package: one-more-re-nightmare.
Source: effects.lisp.

Function: either (r s) ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: empty-set () ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: empty-string () ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: find-code (regular-expression type-specifier) ¶

Package: one-more-re-nightmare.
Source: code-cache.lisp.

Function: find-in-map (variable-name map) ¶

Package: one-more-re-nightmare.
Source: code-generation.lisp.

Function: find-similar-state (states state) ¶

Find another state which we can re-use with some transformation, returning that state and the required transformation.

Package: one-more-re-nightmare.
Source: make-dfa.lisp.

Function: find-state-name (state &optional entry-point) ¶

Package: one-more-re-nightmare.
Source: code-generation.lisp.

Function: find-variable-name (variable) ¶

Package: one-more-re-nightmare.
Source: code-generation.lisp.

Function: fold-or (form next) ¶

Manually constant fold out (OR A NIL) to A. The compiler can do this, but generated code looks nicer with folding.

Package: one-more-re-nightmare.
Source: sets.lisp.

Function: gensym-position-assignments (set) ¶

Replicate any assignments, turning T_n <- s for all s into T^r_n <- T_n for some arbitrary r

Package: one-more-re-nightmare.
Source: tag-sets.lisp.

Function: grep (match-vector prototype) ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: group (r n) ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: has-literals-p (re) ¶

Package: one-more-re-nightmare.
Source: effects.lisp.

Function: has-tags-p (re) ¶

Package: one-more-re-nightmare.
Source: tag-sets.lisp.

Function: invert (r) ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: join (r s) ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: keep-used-assignments (new-re assignments) ¶

Package: one-more-re-nightmare.
Source: tag-sets.lisp.

Function: kleene (r) ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Reader: layout-array-type (instance) ¶

Writer: (setf layout-array-type) (instance) ¶

Package: one-more-re-nightmare.
Source: layout.lisp.
Target Slot: array-type.

Reader: layout-equal (instance) ¶

Writer: (setf layout-equal) (instance) ¶

Package: one-more-re-nightmare.
Source: layout.lisp.
Target Slot: equal.

Reader: layout-from-number (instance) ¶

Writer: (setf layout-from-number) (instance) ¶

Package: one-more-re-nightmare.
Source: layout.lisp.
Target Slot: from-number.

Reader: layout-less (instance) ¶

Writer: (setf layout-less) (instance) ¶

Package: one-more-re-nightmare.
Source: layout.lisp.
Target Slot: less.

Reader: layout-less-or-equal (instance) ¶

Writer: (setf layout-less-or-equal) (instance) ¶

Package: one-more-re-nightmare.
Source: layout.lisp.
Target Slot: less-or-equal.

Function: layout-p (object) ¶

Package: one-more-re-nightmare.
Source: layout.lisp.

Reader: layout-ref (instance) ¶

Writer: (setf layout-ref) (instance) ¶

Package: one-more-re-nightmare.
Source: layout.lisp.
Target Slot: ref.

Reader: layout-to-number (instance) ¶

Writer: (setf layout-to-number) (instance) ¶

Package: one-more-re-nightmare.
Source: layout.lisp.
Target Slot: to-number.

Function: lint-regular-expression (expression) ¶

Package: one-more-re-nightmare.
Source: lint.lisp.

Function: literal (set) ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: make-body-from-dfa (strategy states) ¶

Package: one-more-re-nightmare.
Source: code-generation.lisp.

Function: make-compiled-regular-expression (&key codes original-re) ¶

Package: one-more-re-nightmare.
Source: code-cache.lisp.

Function: make-default-strategy (layout expression) ¶

Package: one-more-re-nightmare.
Source: compilation-strategy.lisp.

Function: make-dfa-from-expression (expression) ¶

Package: one-more-re-nightmare.
Source: make-dfa.lisp.

Function: make-dfa-from-expressions (expressions) ¶

Package: one-more-re-nightmare.
Source: make-dfa.lisp.

Function: make-lambda-form (expression strategy groups) ¶

Package: one-more-re-nightmare.
Source: code-generation.lisp.

Function: make-layout (&key array-type ref from-number to-number less less-or-equal equal) ¶

Package: one-more-re-nightmare.
Source: layout.lisp.

Function: make-search-machine (expression) ¶

Package: one-more-re-nightmare.
Source: compilation-strategy.lisp.

Function: make-test-form (isum variable less-or-equal equal) ¶

Package: one-more-re-nightmare.
Source: sets.lisp.

Function: make-transition (&key class next-state tags-to-set) ¶

Package: one-more-re-nightmare.
Source: make-dfa.lisp.

Function: map-tags (f re) ¶

Package: one-more-re-nightmare.
Source: tag-sets.lisp.

Function: match-vector-size (groups) ¶

Package: one-more-re-nightmare.
Source: code-generation.lisp.

Function: merge-sets (sets1 sets2) ¶

Produce a list of every subset of sets1 and sets2.

Package: one-more-re-nightmare.
Source: derivative-classes.lisp.

Function: merge-tag-sets (set1 set2) ¶

Package: one-more-re-nightmare.
Source: tag-sets.lisp.

Function: next-group () ¶

Package: one-more-re-nightmare.
Source: syntax.lisp.

Function: nullable (re) ¶

(language-of (nullable RE)) = (language-of (both RE (empty-string)))

Package: one-more-re-nightmare.
Source: nullable.lisp.

Function: parse-regular-expression (string) ¶

Package: one-more-re-nightmare.
Source: syntax.lisp.

Function: peephole-optimize (assignments used-tags) ¶

Package: one-more-re-nightmare.
Source: make-dfa.lisp.

Function: print-isum (isum stream) ¶

Package: one-more-re-nightmare.
Source: sets.lisp.

Function: re-empty-p (re) ¶

Is a regular expression basically an empty string?
This is different to NULLABLE, yes, NULLABLE would accept e.g. a* or anything that is a superset of { "" }, but this accepts only the empty string (± tags).

Package: one-more-re-nightmare.
Source: empty.lisp.

Function: re-groups (regular-expression) ¶

Package: one-more-re-nightmare.
Source: interface.lisp.

Function: re-stopped-p (re) ¶

Package: one-more-re-nightmare.
Source: make-dfa.lisp.

Function: remove-tags (re) ¶

Package: one-more-re-nightmare.
Source: tag-sets.lisp.

Function: repeat (r min max can-empty) ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: scan-either-for-duplicates (r s) ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: set-intersection (a b) ¶

Package: one-more-re-nightmare.
Source: sets.lisp.

Function: set-inverse (a) ¶

Package: one-more-re-nightmare.
Source: sets.lisp.

Function: set-null (isum) ¶

Package: one-more-re-nightmare.
Source: sets.lisp.

Function: set-union (a b) ¶

Package: one-more-re-nightmare.
Source: sets.lisp.

Function: setf-from-assignments (assignments) ¶

Package: one-more-re-nightmare.
Source: code-generation.lisp.

Function: similar (from to) ¶

Package: one-more-re-nightmare.
Source: similar.lisp.

Function: singleton-set (x) ¶

Returns the ISUM, that contains only /x/.

Package: one-more-re-nightmare.
Source: sets.lisp.

Function: state-never-succeeds-p (state) ¶

Package: one-more-re-nightmare.
Source: length-inference.lisp.

Function: string-type-of (string) ¶

Package: one-more-re-nightmare.
Source: code-cache.lisp.

Function: subscripts (number) ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: subsequences (vector match-vector) ¶

Package: one-more-re-nightmare.
Source: interface.lisp.

Function: symbol-range (from below) ¶

Returns the ISUM, that contains every code point that is in [from, below)

Package: one-more-re-nightmare.
Source: sets.lisp.

Function: symbol-set (&rest symbols) ¶

Package: one-more-re-nightmare.
Source: sets.lisp.

Function: symbol-set-difference (a b) ¶

Package: one-more-re-nightmare.
Source: sets.lisp.

Function: tag-gensym () ¶

Package: one-more-re-nightmare.
Source: tag-sets.lisp.

Function: tag-set (substitutions) ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: tags (re) ¶

Package: one-more-re-nightmare.
Source: tag-sets.lisp.

Function: text (vector) ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Reader: transition-class (instance) ¶

Writer: (setf transition-class) (instance) ¶

Package: one-more-re-nightmare.
Source: make-dfa.lisp.
Target Slot: class.

Reader: transition-next-state (instance) ¶

Writer: (setf transition-next-state) (instance) ¶

Package: one-more-re-nightmare.
Source: make-dfa.lisp.
Target Slot: next-state.

Function: transition-p (object) ¶

Package: one-more-re-nightmare.
Source: make-dfa.lisp.

Reader: transition-tags-to-set (instance) ¶

Writer: (setf transition-tags-to-set) (instance) ¶

Package: one-more-re-nightmare.
Source: make-dfa.lisp.
Target Slot: tags-to-set.

Function: try-to-evaluate-constant-re (form) ¶

Package: one-more-re-nightmare.
Source: interface.lisp.

Function: unique-assignments (set) ¶

Make assignments unique, turning T_n <- s for all s into T^r_n <- s

Package: one-more-re-nightmare.
Source: tag-sets.lisp.

Function: unique-tags (re) ¶

Package: one-more-re-nightmare.
Source: tag-sets.lisp.

Function: universal-set () ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.

Function: used-tags (re) ¶

Package: one-more-re-nightmare.
Source: tag-sets.lisp.

Function: variable-map-from-groups (groups) ¶

Package: one-more-re-nightmare.
Source: code-generation.lisp.

Function: win-locations (exit-map) ¶

Package: one-more-re-nightmare.
Source: code-generation.lisp.

6.2.5 Generic functions

Generic Reader: cached-has-tags-p (object) ¶

Package

Methods

Reader Method: cached-has-tags-p ((regular-expression regular-expression)) ¶

automatically generated reader method

Source: type.lisp.
Target Slot: %has-tags-p.

Generic Writer: (setf cached-has-tags-p) (object) ¶

Package

Methods

Writer Method: (setf cached-has-tags-p) ((regular-expression regular-expression)) ¶

automatically generated writer method

Source: type.lisp.
Target Slot: %has-tags-p.

Generic Reader: cached-nullable (object) ¶

Package

Methods

Reader Method: cached-nullable ((regular-expression regular-expression)) ¶

automatically generated reader method

Source: type.lisp.
Target Slot: %nullable.

Generic Writer: (setf cached-nullable) (object) ¶

Package

Methods

Writer Method: (setf cached-nullable) ((regular-expression regular-expression)) ¶

automatically generated writer method

Source: type.lisp.
Target Slot: %nullable.

Generic Reader: cached-nullable-no-gensym (object) ¶

Package

Methods

Reader Method: cached-nullable-no-gensym ((regular-expression regular-expression)) ¶

automatically generated reader method

Source: type.lisp.
Target Slot: %nullable-no-gensym.

Generic Writer: (setf cached-nullable-no-gensym) (object) ¶

Package

Methods

Writer Method: (setf cached-nullable-no-gensym) ((regular-expression regular-expression)) ¶

automatically generated writer method

Source: type.lisp.
Target Slot: %nullable-no-gensym.

Generic Reader: cached-removed-tags (object) ¶

Package

Methods

Reader Method: cached-removed-tags ((regular-expression regular-expression)) ¶

automatically generated reader method

Source: type.lisp.
Target Slot: %removed-tags.

Generic Writer: (setf cached-removed-tags) (object) ¶

Package

Methods

Writer Method: (setf cached-removed-tags) ((regular-expression regular-expression)) ¶

automatically generated writer method

Source: type.lisp.
Target Slot: %removed-tags.

Generic Reader: cached-tags (object) ¶

Package

Methods

Reader Method: cached-tags ((regular-expression regular-expression)) ¶

automatically generated reader method

Source: type.lisp.
Target Slot: %tags.

Generic Writer: (setf cached-tags) (object) ¶

Package

Methods

Writer Method: (setf cached-tags) ((regular-expression regular-expression)) ¶

automatically generated writer method

Source: type.lisp.
Target Slot: %tags.

Generic Reader: cached-used-tags (object) ¶

Package

Methods

Reader Method: cached-used-tags ((regular-expression regular-expression)) ¶

automatically generated reader method

Source: type.lisp.
Target Slot: %used-tags.

Generic Writer: (setf cached-used-tags) (object) ¶

Package

Methods

Writer Method: (setf cached-used-tags) ((regular-expression regular-expression)) ¶

automatically generated writer method

Source: type.lisp.
Target Slot: %used-tags.

Generic Function: declarations (strategy) ¶

Package

Source

Methods

Method: declarations ((strategy call-continuation)) ¶

Generic Function: initial-states (strategy expression) ¶

Compute a list of states to start compiling from.

Package

Source

Methods

Method: initial-states ((strategy scan-everything) expression) ¶

Generic Function: lambda-list (strategy) ¶

The lambda list of the function to generate.

Package

Source

Methods

Method: lambda-list ((strategy call-continuation)) ¶

Generic Function: macros-for-strategy (strategy) ¶

A list of macros (at least using including WIN and RESTART) to use for compilation.

Package

Source

Method Combination

append.

Options: :most-specific-first

Methods

Method: macros-for-strategy append ((strategy call-continuation)) ¶

Method: macros-for-strategy append ((strategy scan-everything)) ¶

Generic Function: make-prog-parts (strategy expression) ¶

Package

Source

code-generation.lisp.

Methods

Method: make-prog-parts (strategy expression) ¶

Generic Reader: minimum-length (object) ¶

Package

Methods

Reader Method: minimum-length ((length-inference-info length-inference-info)) ¶

automatically generated reader method

Source: length-inference.lisp.
Target Slot: minimum-length.

Generic Writer: (setf minimum-length) (object) ¶

Package

Methods

Writer Method: (setf minimum-length) ((length-inference-info length-inference-info)) ¶

automatically generated writer method

Source: length-inference.lisp.
Target Slot: minimum-length.

Generic Reader: next-state-name (object) ¶

Package

Methods

Reader Method: next-state-name ((compiler-state compiler-state)) ¶

automatically generated reader method

Source: code-generation.lisp.
Target Slot: next-state-name.

Generic Writer: (setf next-state-name) (object) ¶

Package

Methods

Writer Method: (setf next-state-name) ((compiler-state compiler-state)) ¶

automatically generated writer method

Source: code-generation.lisp.
Target Slot: next-state-name.

Generic Reader: predecessors (object) ¶

Package

Methods

Reader Method: predecessors ((length-inference-info length-inference-info)) ¶

automatically generated reader method

Source: length-inference.lisp.
Target Slot: predecessors.

Generic Writer: (setf predecessors) (object) ¶

Package

Methods

Writer Method: (setf predecessors) ((length-inference-info length-inference-info)) ¶

automatically generated writer method

Source: length-inference.lisp.
Target Slot: predecessors.

Generic Function: start-code (strategy states) ¶

Part of a TAGBODY body used to start running a DFA.

Package

Source

Methods

Method: start-code :around ((strategy call-continuation) states) ¶

Source: code-generation.lisp.

Method: start-code ((strategy scan-everything) states) ¶

Source: code-generation.lisp.

Generic Reader: state-exit-effects (object) ¶

Package

Methods

Reader Method: state-exit-effects ((state state)) ¶

automatically generated reader method

Source: make-dfa.lisp.
Target Slot: exit-effects.

Generic Writer: (setf state-exit-effects) (object) ¶

Package

Methods

Writer Method: (setf state-exit-effects) ((state state)) ¶

automatically generated writer method

Source: make-dfa.lisp.
Target Slot: exit-effects.

Generic Reader: state-exit-map (object) ¶

Package

Methods

Reader Method: state-exit-map ((state state)) ¶

automatically generated reader method

Source: make-dfa.lisp.
Target Slot: exit-map.

Generic Writer: (setf state-exit-map) (object) ¶

Package

Methods

Writer Method: (setf state-exit-map) ((state state)) ¶

automatically generated writer method

Source: make-dfa.lisp.
Target Slot: exit-map.

Generic Reader: state-expression (object) ¶

Package

Methods

Reader Method: state-expression ((state state)) ¶

automatically generated reader method

Source: make-dfa.lisp.
Target Slot: expression.

Generic Writer: (setf state-expression) (object) ¶

Package

Methods

Writer Method: (setf state-expression) ((state state)) ¶

automatically generated writer method

Source: make-dfa.lisp.
Target Slot: expression.

Generic Reader: state-names (object) ¶

Package

Methods

Reader Method: state-names ((compiler-state compiler-state)) ¶

automatically generated reader method

Source: code-generation.lisp.
Target Slot: state-names.

Generic Reader: state-transitions (object) ¶

Package

Methods

Reader Method: state-transitions ((state state)) ¶

automatically generated reader method

Source: make-dfa.lisp.
Target Slot: transitions.

Generic Writer: (setf state-transitions) (object) ¶

Package

Methods

Writer Method: (setf state-transitions) ((state state)) ¶

automatically generated writer method

Source: make-dfa.lisp.
Target Slot: transitions.

Generic Function: transition-code (strategy previous-state transition) ¶

Package

Source

Methods

Method: transition-code (strategy previous-state transition) ¶

Source: code-generation.lisp.

Generic Reader: variable-map (object) ¶

Package

Methods

Reader Method: variable-map ((compiler-state compiler-state)) ¶

automatically generated reader method

Source: code-generation.lisp.
Target Slot: variable-map.

Generic Reader: variable-names (object) ¶

Package

Methods

Reader Method: variable-names ((compiler-state compiler-state)) ¶

automatically generated reader method

Source: code-generation.lisp.
Target Slot: variable-names.

Generic Reader: warning-group-number (condition) ¶

Package

Methods

Reader Method: warning-group-number ((condition group-not-matchable)) ¶

Source: lint.lisp.
Target Slot: n.

Generic Reader: warning-group-string (condition) ¶

Package

Methods

Reader Method: warning-group-string ((condition group-not-matchable)) ¶

Source: lint.lisp.
Target Slot: string.

6.2.6 Conditions

Condition: expression-matches-empty-string ¶

Package: one-more-re-nightmare.
Source: lint.lisp.
Direct superclasses: matching-too-much-style-warning.

Condition: expression-matches-everything ¶

Package: one-more-re-nightmare.
Source: lint.lisp.
Direct superclasses: matching-too-much-style-warning.

Condition: expression-not-matchable ¶

Package: one-more-re-nightmare.
Source: lint.lisp.
Direct superclasses: not-matchable-style-warning.

Condition: group-not-matchable ¶

Package

Source

not-matchable-style-warning.

Direct superclasses

Direct methods

warning-group-number.
warning-group-string.

Direct slots

Slot: n ¶

Initargs: :n
Readers: warning-group-number.
Writers: This slot is read-only.

Slot: string ¶

Package: common-lisp.
Initargs: :string
Readers: warning-group-string.
Writers: This slot is read-only.

Condition: no-match ¶

Package: one-more-re-nightmare.
Source: similar.lisp.
Direct superclasses: condition.

6.2.7 Structures

Structure: layout ¶

A structure representing the type and accessors for a vector of some sort.

Package

Source

layout.lisp.

Direct superclasses

structure-object.

Direct slots

Slot: array-type ¶

Initform: (quote (simple-array character 1))
Readers: layout-array-type.
Writers: (setf layout-array-type).

Slot: ref ¶

Initform: (quote aref)
Readers: layout-ref.
Writers: (setf layout-ref).

Slot: from-number ¶

Initform: (quote code-char)
Readers: layout-from-number.
Writers: (setf layout-from-number).

Slot: to-number ¶

Initform: (quote char-code)
Readers: layout-to-number.
Writers: (setf layout-to-number).

Slot: less ¶

Initform: (quote <)
Readers: layout-less.
Writers: (setf layout-less).

Slot: less-or-equal ¶

Initform: (quote <=)
Readers: layout-less-or-equal.
Writers: (setf layout-less-or-equal).

Slot: equal ¶

Package: common-lisp.
Initform: (quote =)
Readers: layout-equal.
Writers: (setf layout-equal).

Structure: transition ¶

Package

Source

make-dfa.lisp.

Direct superclasses

structure-object.

Direct slots

Slot: class ¶

Package: common-lisp.
Readers: transition-class.
Writers: (setf transition-class).

Slot: next-state ¶

Readers: transition-next-state.
Writers: (setf transition-next-state).

Slot: tags-to-set ¶

Readers: transition-tags-to-set.
Writers: (setf transition-tags-to-set).

6.2.8 Classes

Class: alpha ¶

Package

Source

Direct superclasses

Direct methods

Direct slots

Slot: expression ¶

Slot: history ¶

Class: both ¶

Package

Source

Direct superclasses

Direct methods

Direct slots

Slot: r ¶

Slot: s ¶

Class: call-continuation ¶

A compilation strategy which calls a continuation when a match is found.

Package

Source

Direct superclasses

strategy.

Direct methods

declarations.
lambda-list.
macros-for-strategy.
start-code.

Class: compiler-state ¶

Package

Source

code-generation.lisp.

Direct methods

(setf next-state-name).
next-state-name.
state-names.
variable-map.
variable-names.

Direct slots

Slot: variable-names ¶

Initform: (make-hash-table :test (quote equal))
Readers: variable-names.
Writers: This slot is read-only.

Slot: state-names ¶

Initform: (make-hash-table :test (quote equal))
Readers: state-names.
Writers: This slot is read-only.

Slot: next-state-name ¶

Initform: 0
Readers: next-state-name.
Writers: (setf next-state-name).

Slot: variable-map ¶

Initargs: :variable-map
Readers: variable-map.
Writers: This slot is read-only.

Class: either ¶

Package

Source

Direct superclasses

Direct methods

Direct slots

Slot: r ¶

Slot: s ¶

Class: empty-string ¶

Package: one-more-re-nightmare.
Source: re-types.lisp.
Direct superclasses: regular-expression.
Direct methods: print-object.

Class: grep ¶

Package

Source

Direct superclasses

Direct methods

Direct slots

Slot: vector ¶

Package: common-lisp.

Slot: prototype ¶

Class: invert ¶

Package

Source

Direct superclasses

Direct methods

Direct slots

Slot: r ¶

Class: join ¶

Package

Source

Direct superclasses

Direct methods

Direct slots

Slot: r ¶

Slot: s ¶

Class: length-inference-info ¶

Package

Source

length-inference.lisp.

Direct subclasses

state.

Direct methods

(setf minimum-length).
minimum-length.
(setf predecessors).
predecessors.

Direct slots

Slot: predecessors ¶

Readers: predecessors.
Writers: (setf predecessors).

Slot: minimum-length ¶

Readers: minimum-length.
Writers: (setf minimum-length).

Class: literal ¶

Package

Source

Direct superclasses

Direct methods

Direct slots

Slot: set ¶

Package: common-lisp.

Class: regular-expression ¶

Package

Source

type.lisp.

Direct subclasses

alpha.
both.
either.
empty-string.
grep.
invert.
join.
literal.
repeat.
tag-set.

Direct methods

(setf cached-has-tags-p).
cached-has-tags-p.
(setf cached-nullable).
cached-nullable.
(setf cached-nullable-no-gensym).
cached-nullable-no-gensym.
(setf cached-removed-tags).
cached-removed-tags.
(setf cached-tags).
cached-tags.
(setf cached-used-tags).
cached-used-tags.

Direct slots

Slot: %nullable ¶

Initform: one-more-re-nightmare::+uncomputed+
Readers: cached-nullable.
Writers: (setf cached-nullable).

Slot: %nullable-no-gensym ¶

Initform: one-more-re-nightmare::+uncomputed+
Readers: cached-nullable-no-gensym.
Writers: (setf cached-nullable-no-gensym).

Slot: %used-tags ¶

Initform: one-more-re-nightmare::+uncomputed+
Readers: cached-used-tags.
Writers: (setf cached-used-tags).

Slot: %tags ¶

Initform: one-more-re-nightmare::+uncomputed+
Readers: cached-tags.
Writers: (setf cached-tags).

Slot: %removed-tags ¶

Initform: one-more-re-nightmare::+uncomputed+
Readers: cached-removed-tags.
Writers: (setf cached-removed-tags).

Slot: %has-tags-p ¶

Initform: one-more-re-nightmare::+uncomputed+
Readers: cached-has-tags-p.
Writers: (setf cached-has-tags-p).

Class: repeat ¶

Package

Source

Direct superclasses

Direct methods

Direct slots

Slot: r ¶

Slot: min ¶

Package: common-lisp.

Slot: max ¶

Package: common-lisp.

Slot: can-empty ¶

Class: scan-everything ¶

A compilation strategy which runs a regular expression vector over every position.

Package

Source

Direct superclasses

strategy.

Direct methods

initial-states.
macros-for-strategy.
start-code.

Class: state ¶

Package

Source

make-dfa.lisp.

Direct superclasses

length-inference-info.

Direct methods

print-object.
(setf state-exit-effects).
state-exit-effects.
(setf state-exit-map).
state-exit-map.
(setf state-expression).
state-expression.
(setf state-transitions).
state-transitions.

Direct slots

Slot: exit-map ¶

Initargs: :exit-map
Readers: state-exit-map.
Writers: (setf state-exit-map).

Slot: exit-effects ¶

Initargs: :exit-effects
Readers: state-exit-effects.
Writers: (setf state-exit-effects).

Slot: expression ¶

Initargs: :expression
Readers: state-expression.
Writers: (setf state-expression).

Slot: transitions ¶

Initform: (quote nil)
Readers: state-transitions.
Writers: (setf state-transitions).

Class: strategy ¶

A compilation strategy describes how potential matches should be searched for.

Package

Source

Direct subclasses

call-continuation.
scan-everything.

Class: tag-set ¶

Package

Source

Direct superclasses

Direct methods