This is the parseltongue Reference Manual, version 0.0.1, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sun Jun 15 06:52:19 2025 GMT+0.
The main system appears first, followed by any subsystem dependency.
parseltongueParseltongue
Vincent Toups
Vincent Toups
LGPL
A monadic parser combinator library with Haskell do-like notation.
0.0.1
lisp-unit (system).
package.lisp (file).
parseltongue.lisp (file).
tests.lisp (file).
Files are sorted by type and then listed depth-first from the systems components trees.
parseltongue/parseltongue.asdparseltongue/package.lispparseltongue/parseltongue.lispparseltongue/tests.lispparseltongue/parseltongue.lisppackage.lisp (file).
parseltongue (system).
=>and (function).
=>eq (function).
=>equal (function).
=>items (function).
=>items->string (function).
=>maybe (function).
=>maybe-alternative (function).
=>one-plus-more (function).
=>or (function).
=>reduce-concat (function).
=>satisfies (function).
=>string (function).
=>zero-plus-more (function).
=item (special variable).
=item (function).
=rest (special variable).
=rest (function).
defparser (macro).
empty? (method).
empty? (method).
next (method).
next (method).
parse/first-result (function).
parser (macro).
parser-bind (function).
parser-pair (function).
parser-pair (structure).
parser-return (function).
rest-of (method).
rest-of (method).
=> (function).
=>and2 (function).
=>list (function).
=>or2 (function).
=nil (special variable).
=nil (function).
alist (function).
alist-cons (function).
bind-form? (function).
copy-parser-pair (function).
defun/var (macro).
empty-of (method).
empty-of (method).
make-parser-pair (function).
mapcar/deal (function).
named-let (macro).
parser-helper (macro).
parser-pair-input (reader).
(setf parser-pair-input) (writer).
parser-pair-p (function).
parser-pair-value (reader).
(setf parser-pair-value) (writer).
parser-plus (function).
prefix (method).
prefix (method).
reverse-alist-keys (function).
strcat (function).
zero-plus-more-step (function).
parseltongue/tests.lispparseltongue.lisp (file).
parseltongue (system).
Packages are listed by definition order.
parseltonguecommon-lisp.
lisp-unit.
=>and (function).
=>eq (function).
=>equal (function).
=>items (function).
=>items->string (function).
=>maybe (function).
=>maybe-alternative (function).
=>one-plus-more (function).
=>or (function).
=>reduce-concat (function).
=>satisfies (function).
=>string (function).
=>zero-plus-more (function).
=item (special variable).
=item (function).
=rest (special variable).
=rest (function).
defparser (macro).
empty? (generic function).
next (generic function).
parse/first-result (function).
parser (macro).
parser-bind (function).
parser-pair (function).
parser-pair (structure).
parser-return (function).
rest-of (generic function).
=> (function).
=>and2 (function).
=>list (function).
=>or2 (function).
=nil (special variable).
=nil (function).
alist (function).
alist-cons (function).
bind-form? (function).
copy-parser-pair (function).
defun/var (macro).
empty-of (generic function).
make-parser-pair (function).
mapcar/deal (function).
named-let (macro).
parser-helper (macro).
parser-pair-input (reader).
(setf parser-pair-input) (writer).
parser-pair-p (function).
parser-pair-value (reader).
(setf parser-pair-value) (writer).
parser-plus (function).
prefix (generic function).
reverse-alist-keys (function).
strcat (function).
zero-plus-more-step (function).
Definitions are sorted by export status, category, package, and then by lexicographic order.
A parser
A parser
Produce a parser which parses P zero or more times and monadically returns the results in a list.
Return the value at KEY or NIL.
CONS VAL onto the LIST held at KEY in the ALIST A.
Map FUN over LST. FUN returns a list of two items, the first of which is a key the second of which is a value. The VALUES are accumulated at the KEYS in an ALIST which is returned.
Reverse the lists held at each key in A.
Apply PARSER to the CDR of substate. If it succeeds, cons the result onto the list in the CAR of substate and indicate CONTINUE for MAPCAR/DEAL. If PARSER on CDR of substate FAILS, then reverse the CAR of SUBSTATE and return this value consed with the last INPUT state.
| Jump to: | (
=
A B C D E F G M N P R S Z |
|---|
| Jump to: | (
=
A B C D E F G M N P R S Z |
|---|
| Jump to: | =
I S V |
|---|
| Jump to: | =
I S V |
|---|
| Jump to: | F P S T |
|---|
| Jump to: | F P S T |
|---|