Next: Introduction, Previous: (dir), Up: (dir) [Contents][Index]
This is the parenml Reference Manual, version 0.1, generated automatically by Declt version 2.4 "Will Decker" on Wed Jun 20 12:22:20 2018 GMT+0.
• Introduction: | What parenml is all about | |
• Systems: | The systems documentation | |
• Modules: | The modules documentation | |
• Files: | The files documentation | |
• Packages: | The packages documentation | |
• Definitions: | The symbols documentation | |
• Indexes: | Concepts, functions, variables and data types |
An S-expression markup language.
(:section (Counting)
(:deflist
(:item (Sum Rule)
(If two tasks can be performed in $m$ and $n$ ways, respectively, then
there are $m + n$ ways of doing (:b either).))
(:item (Product Rule)
(If two sequential tasks can be performed in $m$ and $n$ ways,
respectively, there are $m * n$ ways of performing the sequence.))))
Copyright (c) 2014 Fernando Borretti
Licensed under the MIT License.
Next: Modules, Previous: Introduction, Up: Top [Contents][Index]
The main system appears first, followed by any subsystem dependency.
• The parenml system: |
Fernando Borretti <eudoxiahp@gmail.com>
Fernando Borretti <eudoxiahp@gmail.com>
MIT
S-expression markup language.
# ParenML
[](https://travis-ci.org/CommonDoc/parenml)
An S-expression markup language.
# Overview
# Usage
# Examples
“‘lisp
(:section (Counting)
(:deflist
(:item (Sum Rule)
(If two tasks can be performed in $m$ and $n$ ways, respectively, then
there are $m + n$ ways of doing (:b either).))
(:item (Product Rule)
(If two sequential tasks can be performed in $m$ and $n$ ways,
respectively, there are $m * n$ ways of performing the sequence.))))
“‘
# License
Copyright (c) 2014 Fernando Borretti
Licensed under the MIT License.
0.1
parenml.asd (file)
src (module)
Modules are listed depth-first from the system components tree.
• The parenml/src module: |
parenml (system)
src/
Files are sorted by type and then listed depth-first from the systems components trees.
• Lisp files: |
• The parenml.asd file: | ||
• The parenml/src/parser.lisp file: | ||
• The parenml/src/emitter.lisp file: |
Next: The parenml/src/parser<dot>lisp file, Previous: Lisp files, Up: Lisp files [Contents][Index]
parenml.asd
parenml (system)
Next: The parenml/src/emitter<dot>lisp file, Previous: The parenml<dot>asd file, Up: Lisp files [Contents][Index]
src (module)
src/parser.lisp
parse-string (function)
Previous: The parenml/src/parser<dot>lisp file, Up: Lisp files [Contents][Index]
parser.lisp (file)
src (module)
src/emitter.lisp
Next: Definitions, Previous: Files, Up: Top [Contents][Index]
Packages are listed by definition order.
• The parenml.parser package: | ||
• The parenml.emitter package: |
Next: The parenml<dot>emitter package, Previous: Packages, Up: Packages [Contents][Index]
Parse ParenML input into an S-expression.
parser.lisp (file)
parse-string (function)
Previous: The parenml<dot>parser package, Up: Packages [Contents][Index]
Create an S-expression from a CommonDoc document.
emitter.lisp (file)
Definitions are sorted by export status, category, package, and then by lexicographic order.
• Exported definitions: |
Previous: Definitions, Up: Definitions [Contents][Index]
• Exported functions: |
Previous: Exported definitions, Up: Exported definitions [Contents][Index]
Parse a ParenML string into an S-expression.
parser.lisp (file)
Previous: Definitions, Up: Top [Contents][Index]
• Concept index: | ||
• Function index: | ||
• Variable index: | ||
• Data type index: |
Next: Function index, Previous: Indexes, Up: Indexes [Contents][Index]
Jump to: | F L M P |
---|
Jump to: | F L M P |
---|
Next: Variable index, Previous: Concept index, Up: Indexes [Contents][Index]
Jump to: | F P |
---|
Index Entry | Section | ||
---|---|---|---|
| |||
F | |||
Function, parse-string : | Exported functions | ||
| |||
P | |||
parse-string : | Exported functions | ||
|
Jump to: | F P |
---|
Next: Data type index, Previous: Function index, Up: Indexes [Contents][Index]
Previous: Variable index, Up: Indexes [Contents][Index]
Jump to: | P S |
---|
Jump to: | P S |
---|