This index is of terms that are used in a special sense in
this document.
Not every use of these terms is indexed —
only those uses that are in some way defining.
| Index Entry | | Section |
|---|
|
| @ | | |
|---|
| @-notation for nulled instance: | | Trees |
| @-notation for rule instance: | | Trees |
| @-notation for sequence instance: | | Trees |
| @-notation for symbol instance: | | Trees |
|
| A | | |
|---|
| accessible rule: | | Useless rules |
| accessible symbol: | | Useless rules |
| activated event subtype: | | Events overview |
| active (valuator): | | Valuator constructor |
| active parse: | | Exhaustion |
| advanced input model: | | Advanced input models |
| advanced models of input: | | The basic models of input |
| ambiguous: | | Ambiguity |
| ancestor: | | Trees |
| ancestor (object): | | Time objects |
| ancestor, proper: | | Trees |
| ancestor, trivial: | | Trees |
| ancestry-recoverable hard failure: | | Ancestry-recoverable hard failure |
| application: | | Miscellaneous definitions |
| application behavior: | | Application and diagnostic behavior |
| application environment: | | Miscellaneous definitions |
| application environment limit: | | Miscellaneous definitions |
| applications, exhaustion-hating: | | Exhaustion |
| applications, exhaustion-loving: | | Exhaustion |
| archetypal Libmarpa application: | | About the overviews |
| at (a location, wrt a symbol): | | Trees |
|
| B | | |
|---|
| base (object): | | Time objects |
| base grammar (of a time object): | | Time objects |
| basic models of input: | | The basic models of input |
| behavior, application: | | Application and diagnostic behavior |
| behavior, diagnostic: | | Application and diagnostic behavior |
| BNF: | | Rules |
| BNF node: | | Trees |
| boolean: | | Miscellaneous definitions |
| boolean value: | | Miscellaneous definitions |
| bottom-up traversal: | | Traversal |
|
| C | | |
|---|
| child (of a node): | | Trees |
| child object (of a time object): | | Time objects |
| children (of a node): | | Trees |
| codepoint-per-earleme input model: | | The codepoint-per-earleme model |
| completed dotted rule: | | Earley items |
| completed Earley item: | | Earley items |
| completion (dotted rule): | | Earley items |
| completion (Earley item): | | Earley items |
| context-free grammar: | | Rules |
| counted symbol: | | Sequence methods |
| current location (in an Earley item): | | Earley items |
| current node (of a progress report traverser): | | Progress report traverser |
| cycle: | | Recursion and cycles |
| cycle-free: | | Recursion and cycles |
|
| D | | |
|---|
| declared event subtype: | | Events overview |
| dense variable-length input model: | | The dense variable-length token model |
| depth-first traversal: | | Traversal |
| derivation: | | Derivations |
| derivation step: | | Derivations |
| derivation, leftmost: | | An example tree |
| derivation, rightmost: | | An example tree |
| derives: | | Derivations |
| derives, directly: | | Derivations |
| descendant: | | Trees |
| descendant (object): | | Time objects |
| descendant, proper: | | Trees |
| descendant, trivial: | | Trees |
| diagnostic behavior: | | Application and diagnostic behavior |
| directly derives: | | Derivations |
| dot position: | | Earley items |
| dotted rule: | | Earley items |
|
| E | | |
|---|
| earleme: | | Earlemes and Earley set IDs |
| earleme, current: | | The current earleme |
| earleme, empty: | | The fully general input model |
| earleme, furthest: | | The furthest earleme |
| earleme, latest: | | The latest earleme |
| Earley item: | | Earley items |
| Earley item warning threshold: | | Other parse status methods |
| Earley set ID: | | Earlemes and Earley set IDs |
| Earley set, latest: | | The latest Earley set |
| empty earleme: | | The fully general input model |
| empty rule: | | Rules |
| empty rule: | | Rules |
| empty sentence: | | Nulling |
| empty string: | | Nulling |
| end of file: | | Determining EOP from EOI |
| end of input: | | Determining EOP from EOI |
| end of parse: | | End of parse |
| end of string: | | Determining EOP from EOI |
| end sentinel: | | Progress report traverser |
| end sentinel node: | | Progress report traverser |
| environment limit: | | Miscellaneous definitions |
| environment, application: | | Miscellaneous definitions |
| EOF: | | Determining EOP from EOI |
| EOI: | | Determining EOP from EOI |
| EOP: | | End of parse |
| EOS: | | Determining EOP from EOI |
| evaluate (a parse run): | | Semantics terms |
| evaluate (a tree): | | Semantics terms |
| evaluate (an input string): | | Semantics terms |
| event queue: | | Events overview |
| event, global: | | Events overview |
| event, per-symbol: | | Events overview |
| event-safe (method): | | Events overview |
| event-triggering (method): | | Events overview |
| events, recognizer per-symbol: | | Recognizer per-symbol events |
| exhausted parse: | | Exhaustion |
| exhaustion on failure: | | Exhaustion |
| exhaustion on success: | | Exhaustion |
| exhaustion-hating applications: | | Exhaustion |
| exhaustion-loving applications: | | Exhaustion |
| expected symbol: | | Earley items |
| explicit event type: | | Events overview |
|
| F | | |
|---|
| failure: | | User non-conformity to specified behavior |
| failure, ancestry-recoverable hard: | | Ancestry-recoverable hard failure |
| failure, fully recoverable hard: | | Fully recoverable hard failure |
| failure, hard: | | Classifying failure |
| failure, irrecoverable hard: | | Irrecoverable hard failure |
| failure, Libmarpa application programming: | | User non-conformity to specified behavior |
| failure, library-recoverable hard: | | Library-recoverable hard failure |
| failure, memory allocation: | | Memory allocation failure |
| failure, partially recoverable hard: | | Partially recoverable hard failure |
| failure, soft: | | Classifying failure |
| failure, soft: | | Soft failure |
| failure, undetected: | | Undetected failure |
| forest: | | Trees |
| frozen ordering: | | Freezing the ordering |
| fully recoverable hard failure: | | Fully recoverable hard failure |
|
| G | | |
|---|
| global event: | | Events overview |
| global event: | | Events overview |
| grammar: | | Parsing theory preliminaries |
|
| H | | |
|---|
| hard failure: | | Classifying failure |
| hard failure, ancestry-recoverable: | | Ancestry-recoverable hard failure |
| hard failure, fully recoverable: | | Fully recoverable hard failure |
| hard failure, irrecoverable: | | Irrecoverable hard failure |
| hard failure, library-recoverable: | | Library-recoverable hard failure |
| hard failure, partially recoverable: | | Partially recoverable hard failure |
|
| I | | |
|---|
| ID (of an Earley set): | | Earlemes and Earley set IDs |
| iff: | | Miscellaneous definitions |
| immediately previous (to a marpa_r_earleme_complete() call): | | The standard model of input |
| implicit event type: | | Events overview |
| in use (LHS terminals): | | Overview of LHS terminals |
| inaccessible rule: | | Useless rules |
| inaccessible symbol: | | Useless rules |
| inactive (valuator): | | Stepping through the valuator |
| indeterminate value: | | Miscellaneous definitions |
| indirect: | | Derivations |
| infinitely ambiguous: | | Recursion and cycles |
| input: | | Parsing theory preliminaries |
| input: | | Parsing theory preliminaries |
| input model, advanced: | | Advanced input models |
| input model, dense variable-length: | | The dense variable-length token model |
| input model, sparse variable-length: | | The fully general input model |
| input model, variable-length token: | | Advanced input models |
| input sentence: | | Parsing theory preliminaries |
| input text: | | Parsing theory preliminaries |
| input, advanced models of: | | The basic models of input |
| input, basic models of: | | The basic models of input |
| instance: | | Trees |
| instance (of a symbol): | | Trees |
| instance (of a symbol): | | Trees |
| irrecoverable hard failure: | | Irrecoverable hard failure |
| iterator, parse tree: | | Tree overview |
|
| L | | |
|---|
| labeled ordered tree: | | Trees |
| labeled ordered tree node: | | Trees |
| language: | | Parsing theory preliminaries |
| language: | | Derivations |
| latest Earley set: | | The latest Earley set |
| leaf (node): | | Trees |
| leaf node: | | Trees |
| left hand side: | | Rules |
| left-recursive: | | Recursion and cycles |
| leftmost derivation: | | An example tree |
| length: | | Parsing theory preliminaries |
| length: | | Derivations |
| length (of a node): | | Trees |
| length, rule: | | Rules |
| lexeme: | | Parsing theory preliminaries |
| lexer: | | Parsing theory preliminaries |
| lexical analysis: | | Parsing theory preliminaries |
| lexical analyzer: | | Parsing theory preliminaries |
| lexing: | | Parsing theory preliminaries |
| LHS: | | Rules |
| LHS (of a rule node): | | Trees |
| LHS terminals in use: | | Overview of LHS terminals |
| Libmarpa application programming failure: | | User non-conformity to specified behavior |
| Libmarpa application programming success: | | User non-conformity to specified behavior |
| Libmarpa application, archetypal: | | About the overviews |
| library-recoverable hard failure: | | Library-recoverable hard failure |
| limit, application environment: | | Miscellaneous definitions |
| limit, environment: | | Miscellaneous definitions |
| locked terminal status: | | LHS terminal methods |
| locked value status (of a symbol): | | What unvalued symbols were |
|
| M | | |
|---|
| matches: | | Derivations |
| matches: | | Derivations |
| max(x,y): | | Miscellaneous definitions |
| memory allocation failure: | | Memory allocation failure |
| method: | | Miscellaneous definitions |
| models of input, advanced: | | The basic models of input |
| models of input, basic: | | The basic models of input |
|
| N | | |
|---|
| node (of a tree): | | Trees |
| node length: | | Trees |
| node, current (of a progress report traverser): | | Progress report traverser |
| node, labeled ordered tree: | | Trees |
| node, root: | | Trees |
| node, start: | | Trees |
| non-empty: | | Nulling |
| non-nullable: | | Nulling |
| non-nullable: | | Nulling |
| non-nulling: | | Nulling |
| non-nulling: | | Nulling |
| non-trivial: | | Derivations |
| null derivation: | | Nulling |
| null parse: | | Nulling |
| nullable rule: | | Nulling |
| nullable symbol: | | Nulling |
| nulled (of a symbol): | | Trees |
| nulled node: | | Trees |
| nulled symbol instance: | | Trees |
| nulling node: | | Trees |
| nulling rule: | | Nulling |
| nulling symbol: | | Nulling |
|
| O | | |
|---|
| one-codepoint-per-earleme input model: | | The codepoint-per-earleme model |
| ordering, frozen: | | Freezing the ordering |
| origin (in an Earley item): | | Earley items |
| our: | | Miscellaneous definitions |
|
| P | | |
|---|
| parent (wrt a node): | | Trees |
| parent object (of a time object): | | Time objects |
| parse (aka parse forest): | | Trees |
| parse (aka parse run): | | Trees |
| parse (aka parse tree): | | Trees |
| parse (forest): | | Trees |
| parse exhaustion on failure: | | Exhaustion |
| parse exhaustion on success: | | Exhaustion |
| parse forest: | | Trees |
| parse tree: | | Tree overview |
| parse tree iterator: | | Tree overview |
| parse, active: | | Exhaustion |
| parse, exhausted: | | Exhaustion |
| parser: | | Parsing theory preliminaries |
| partially recoverable hard failure: | | Partially recoverable hard failure |
| pause (a parent tree iterator): | | Valuator constructor |
| per-symbol event: | | Events overview |
| per-symbol event: | | Events overview |
| postdot symbol (of a dotted rule): | | Earley items |
| postdot symbol (of an Earley item): | | Earley items |
| postorder traversal: | | Traversal |
| predicted dotted rule: | | Earley items |
| predicted Earley item: | | Earley items |
| prediction (dotted rule): | | Earley items |
| prediction (Earley item): | | Earley items |
| previous (to a marpa_r_earleme_complete() call), immediately: | | The standard model of input |
| produces: | | Derivations |
| productive rule: | | Useless rules |
| productive symbol: | | Useless rules |
| proper ancestor: | | Trees |
| proper descendant: | | Trees |
|
| R | | |
|---|
| raw input: | | Parsing theory preliminaries |
| reachable rule: | | Useless rules |
| reachable symbol: | | Useless rules |
| recognizer: | | Parsing theory preliminaries |
| recognizer per-symbol events: | | Recognizer per-symbol events |
| recursive: | | Recursion and cycles |
| RHS: | | Rules |
| RHS (of a rule node): | | Trees |
| right hand side: | | Rules |
| right-recursive: | | Recursion and cycles |
| rightmost derivation: | | An example tree |
| root node: | | Trees |
| Ruby Slippers: | | Recognizer life cycle mutators |
| rule: | | Parsing theory preliminaries |
| rule creation methods: | | Rule methods |
| rule creation methods: | | Sequence methods |
| rule length: | | Rules |
| rule node: | | Trees |
| rule, accessible: | | Useless rules |
| rule, inaccessible: | | Useless rules |
| rule, nullable: | | Nulling |
| rule, nulling: | | Nulling |
| rule, productive: | | Useless rules |
| rule, reachable: | | Useless rules |
| rule, unproductive: | | Useless rules |
| rule, unreachable: | | Useless rules |
| rule, useless: | | Useless rules |
|
| S | | |
|---|
| scanner: | | Parsing theory preliminaries |
| scanning: | | Parsing theory preliminaries |
| semantics: | | Parsing theory preliminaries |
| semantics: | | Semantics terms |
| sentence: | | Parsing theory preliminaries |
| sentential form: | | Parsing theory preliminaries |
| sequence node: | | Trees |
| sequence rule: | | Rules |
| soft failure: | | Classifying failure |
| soft failure: | | Soft failure |
| sparse variable-length input model: | | The fully general input model |
| start node: | | Trees |
| start sentinel: | | Progress report traverser |
| start sentinel node: | | Progress report traverser |
| step: | | Derivations |
| step (of a valuator): | | Stepping through the valuator |
| step type: | | Stepping through the valuator |
| step type, valuator: | | Stepping through the valuator |
| string: | | Parsing theory preliminaries |
| subtree: | | Trees |
| success: | | User non-conformity to specified behavior |
| success, Libmarpa application programming: | | User non-conformity to specified behavior |
| successful: | | Derivations |
| symbol: | | Parsing theory preliminaries |
| symbol instance, nulled: | | Trees |
| symbol string: | | Parsing theory preliminaries |
| symbol string input: | | Parsing theory preliminaries |
| symbol string input: | | Parsing theory preliminaries |
| symbol, accessible: | | Useless rules |
| symbol, counted: | | Sequence methods |
| symbol, inaccessible: | | Useless rules |
| symbol, productive: | | Useless rules |
| symbol, reachable: | | Useless rules |
| symbol, unproductive: | | Useless rules |
| symbol, unreachable: | | Useless rules |
| symbol, unvalued: | | What unvalued symbols were |
| symbol, useless: | | Useless rules |
|
| T | | |
|---|
| terminal node: | | Trees |
| terminal status (of a symbol): | | LHS terminal methods |
| token node: | | Trees |
| token stream: | | Parsing theory preliminaries |
| token-per-earleme input models: | | The codepoint-per-earleme model |
| tokens: | | Parsing theory preliminaries |
| trap representations: | | Trap representations |
| trap value: | | Miscellaneous definitions |
| traverse: | | Traversal |
| tree: | | Trees |
| tree: | | Tree overview |
| tree node: | | Trees |
| tree node, labeled ordered: | | Trees |
| tree, labeled ordered: | | Trees |
| trivial ancestor: | | Trees |
| trivial derivation: | | Derivations |
| trivial descendant: | | Trees |
|
| U | | |
|---|
| unambiguous: | | Ambiguity |
| undefined behavior: | | Miscellaneous definitions |
| undetected failure: | | Undetected failure |
| unproductive rule: | | Useless rules |
| unproductive symbol: | | Useless rules |
| unreachable: | | Useless rules |
| unreachable rule: | | Useless rules |
| unreachable symbol: | | Useless rules |
| unspecified behavior: | | Miscellaneous definitions |
| unspecified value: | | Miscellaneous definitions |
| unvalued symbol: | | What unvalued symbols were |
| us: | | Miscellaneous definitions |
| useless rule: | | Useless rules |
| useless symbol: | | Useless rules |
| user: | | Miscellaneous definitions |
|
| V | | |
|---|
| valuator: | | Value overview |
| valuator step: | | Stepping through the valuator |
| valuator step type: | | Stepping through the valuator |
| value: | | Parsing theory preliminaries |
| value: | | Semantics terms |
| value status, locked (of a symbol): | | What unvalued symbols were |
| value, boolean: | | Miscellaneous definitions |
| variable-length input model, dense: | | The dense variable-length token model |
| variable-length input model, sparse: | | The fully general input model |
| variable-length token input model: | | Advanced input models |
|
| W | | |
|---|
| we: | | Miscellaneous definitions |
|