This is the com.gigamonkeys.parser Reference Manual, generated automatically by Declt version 4.0 beta 2 "William Riker" on Mon Aug 15 05:24:56 2022 GMT+0.
Next: Files, Previous: The com.gigamonkeys.parser Reference Manual, Up: The com.gigamonkeys.parser Reference Manual [Contents][Index]
The main system appears first, followed by any subsystem dependency.
Parser generator, loosely based on Henry Baker’s META paper.
Peter Seibel <peter@gigamonkeys.com>
Next: Packages, Previous: Systems, Up: The com.gigamonkeys.parser Reference Manual [Contents][Index]
Files are sorted by type and then listed depth-first from the systems components trees.
Next: com.gigamonkeys.parser/packages.lisp, Previous: Lisp, Up: Lisp [Contents][Index]
com.gigamonkeys.parser (system).
Next: com.gigamonkeys.parser/parser.lisp, Previous: com.gigamonkeys.parser/com.gigamonkeys.parser.asd, Up: Lisp [Contents][Index]
com.gigamonkeys.parser (system).
Previous: com.gigamonkeys.parser/packages.lisp, Up: Lisp [Contents][Index]
packages.lisp (file).
com.gigamonkeys.parser (system).
Next: Definitions, Previous: Files, Up: The com.gigamonkeys.parser Reference Manual [Contents][Index]
Packages are listed by definition order.
Next: com.gigamonkeys.math-parser, Previous: Packages, Up: Packages [Contents][Index]
Next: com.gigamonkeys.parser, Previous: com.gigamonkeys.parser.dot-parser, Up: Packages [Contents][Index]
Next: com.gigamonkeys.css, Previous: com.gigamonkeys.math-parser, Up: Packages [Contents][Index]
common-lisp.
Next: com.gigamonkeys.java-lexer, Previous: com.gigamonkeys.parser, Up: Packages [Contents][Index]
Next: com.gigamonkeys.new-parser, Previous: com.gigamonkeys.css, Up: Packages [Contents][Index]
Next: com.gigamonkeys.parser.time-period-parser, Previous: com.gigamonkeys.java-lexer, Up: Packages [Contents][Index]
common-lisp.
Previous: com.gigamonkeys.new-parser, Up: Packages [Contents][Index]
Next: Indexes, Previous: Packages, Up: The com.gigamonkeys.parser Reference Manual [Contents][Index]
Definitions are sorted by export status, category, package, and then by lexicographic order.
Next: Internals, Previous: Definitions, Up: Definitions [Contents][Index]
Next: Generic functions, Previous: Public Interface, Up: Public Interface [Contents][Index]
Define a character-type production. The body should be a typespec that defines a type whose extension is a subset of characters, e.g. ’(member #a #b #c)
Define a parser that collects a vector of tokens.
Define a parser function in the PARSER grammar language.
Define an arbitrary production in the PARSER grammar language.
Define local parsers. Parslet is to defparser as flet is to defun.
Next: Standalone methods, Previous: Macros, Up: Public Interface [Contents][Index]
automatically generated reader method
Previous: Generic functions, Up: Public Interface [Contents][Index]
Previous: Public Interface, Up: Definitions [Contents][Index]
Next: Ordinary functions, Previous: Internals, Up: Internals [Contents][Index]
Next: Generic functions, Previous: Special variables, Up: Internals [Contents][Index]
Tokenize the given file with the given lexer function.
Next: Classes, Previous: Ordinary functions, Up: Internals [Contents][Index]
Emit the code to match the gramar
Matches only if the sub-grammar fails to match or, if it does match, if index hasn’t moved up to end-match. (I.e. this can only be used inside a conjuctive grammar.
Emit the whole body of the parser.
Emit code for a function definition that will match the grammar of a given production
automatically generated reader method
form.
automatically generated reader method
automatically generated reader method
Make a tree of grammar objects from an s-expression.
automatically generated reader method
name.
automatically generated reader method
name.
automatically generated reader method
name.
Return a list of productions called by the grammar
A composite grammar uses whatever is in its sub-grammar.
A sequence grammar uses all the productions its sub-grammars call.
A production call uses its production.
Return a list of productions used by a grammar or a gramatical production.
A composite grammar uses whatever is in its sub-grammar.
A sequence grammar uses all the productions its sub-grammars call.
A production call uses the called production and any productions in its own grammar.
automatically generated reader method
automatically generated reader method
automatically generated reader method
Previous: Generic functions, Up: Internals [Contents][Index]
:sub-grammar
This slot is read-only.
:tokens
:sub-grammars
This slot is read-only.
Previous: Definitions, Up: The com.gigamonkeys.parser Reference Manual [Contents][Index]
Jump to: | (
C D E F G I K M N P S T V |
---|
Jump to: | (
C D E F G I K M N P S T V |
---|
Next: Data types, Previous: Functions, Up: Indexes [Contents][Index]
Jump to: | *
F G K N S T V |
---|
Jump to: | *
F G K N S T V |
---|
Jump to: | A B C F G L N O P S T |
---|
Jump to: | A B C F G L N O P S T |
---|