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 |
|
A | | |
| accessible: | | Useless rules |
| accessible: | | Useless rules |
| accessible rule: | | Rule methods |
| accessible symbol: | | Symbol methods |
| activate (a completion symbol event): | | Completion events |
| activate (a nulled symbol event): | | Symbol nulled events |
| activate (a prediction symbol event): | | Prediction events |
| active (valuator): | | Valuator constructor |
| active parse: | | Exhaustion |
| advanced input model: | | Advanced input models |
| advanced models of input: | | The basic models of input |
| ambiguous: | | Ambiguity |
| 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 |
| 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 |
|
C | | |
| child (of a node): | | Trees |
| child object (of a time object): | | Time objects |
| children (of a node): | | Trees |
| context-free grammar: | | Rules |
| counted symbol: | | Sequence methods |
| current vertex (of a progress report traverser): | | Progress reports |
| cycle: | | Recursion and cycles |
| cycle-free: | | Recursion and cycles |
|
D | | |
| dense variable-length input model: | | The dense variable-length token model |
| derivation: | | Derivations |
| derivation step: | | Derivations |
| 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 |
|
E | | |
| earleme: | | The traditional input model |
| earleme, current: | | The current earleme |
| earleme, empty: | | The fully general input model |
| earleme, furthest: | | The furthest earleme |
| earleme, latest: | | The latest earleme |
| Earley item warning threshold: | | Other parse status methods |
| Earley set, end of parse: | | Bocage data structure |
| Earley set, latest: | | The latest earleme |
| empty earleme: | | The fully general input model |
| empty rule: | | Rules |
| empty rule: | | Rules |
| empty sentence: | | Nulling |
| empty string: | | Nulling |
| End of parse Earley set: | | Bocage data structure |
| Evaluating (a tree): | | Evaluating a parse |
| event, expected symbol: | | Symbol expected events |
| event-generating (method): | | Events overview |
| event-safe (method): | | Events overview |
| exhausted parse: | | Exhaustion |
| exhaustion-hating applications: | | Exhaustion |
| exhaustion-loving applications: | | Exhaustion |
| expected symbol event: | | Symbol expected events |
|
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 | | |
| 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): | | The traditional input model |
| iff: | | Miscellaneous definitions |
| immediately previous (to a marpa_r_earleme_complete() call): | | The standard model of input |
| in use (LHS terminals): | | Overview of LHS terminals |
| inaccessible: | | Useless rules |
| inaccessible: | | Useless rules |
| inactive (valuator): | | Stepping through the valuator |
| indeterminate value: | | Miscellaneous definitions |
| indirect: | | Derivations |
| infinitely ambiguous: | | Recursion and cycles |
| input: | | Stages of parsing |
| 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: | | Stages of parsing |
| input text: | | Stages of parsing |
| 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 |
| leaf (node): | | Trees |
| leaf node: | | Trees |
| left hand side: | | Rules |
| left-recursive: | | Recursion and cycles |
| length: | | Parsing theory preliminaries |
| length: | | Derivations |
| length (of a node): | | Trees |
| lexer: | | Stages of parsing |
| lexical analysis: | | Stages of parsing |
| lexical analyzer: | | Stages of parsing |
| lexing: | | Stages of parsing |
| 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 |
| locked terminal status: | | LHS terminal methods |
| locked value status (of a symbol): | | What unvalued symbols were |
|
M | | |
| mark (as a completion event symbol): | | Completion events |
| mark (as a nulled event symbol): | | Symbol nulled events |
| mark (as a prediction event symbol): | | Prediction events |
| matches: | | Derivations |
| matches: | | Derivations |
| max(x,y): | | Miscellaneous definitions |
| memory allocation failur: | | 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 | | |
| next vertex (of a progress report traverser): | | Progress reports |
| node (of a tree): | | Trees |
| node length: | | Trees |
| node, labeled ordered tree: | | 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 |
| null vertex: | | Progress reports |
| nullable rule: | | Nulling |
| nullable rule: | | Rule methods |
| nullable symbol: | | Nulling |
| nullable symbol: | | Symbol methods |
| nulled (of a symbol): | | Trees |
| nulled node: | | Trees |
| nulled symbol instance: | | Trees |
| nulling node: | | Trees |
| nulling rule: | | Nulling |
| nulling rule: | | Rule methods |
| nulling symbol: | | Nulling |
| nulling symbol: | | Symbol methods |
|
O | | |
| ordering, frozen: | | Freezing the ordering |
| ordinal (of an Earley set): | | The traditional input model |
| our: | | Miscellaneous definitions |
|
P | | |
| parent (wrt a node): | | Trees |
| parent object (of a time object): | | Time objects |
| parse (forest): | | Trees |
| parse (output of a parser): | | Trees |
| parse forest: | | Trees |
| parse tree: | | Tree overview |
| parse tree iterator: | | Tree overview |
| parse, active: | | Exhaustion |
| parse, exhausted: | | Exhaustion |
| parser: | | Stages of parsing |
| parsing: | | Stages of parsing |
| parsing: | | Stages of parsing |
| parsing: | | Stages of parsing |
| Parsing in the loose sense: | | Stages of parsing |
| parsing in the strict sense: | | Stages of parsing |
| partially recoverable hard failure: | | Partially recoverable hard failure |
| pause (a parent tree iterator): | | Valuator constructor |
| previous (to a marpa_r_earleme_complete() call), immediately: | | The standard model of input |
| produces: | | Derivations |
| productive: | | Useless rules |
| productive: | | Useless rules |
| productive rule: | | Rule methods |
| productive symbol: | | Symbol methods |
| progress report item: | | Progress reports |
| progress report traverser: | | Progress reports |
| proper ancestor: | | Trees |
| proper descendant: | | Trees |
|
R | | |
| raw input: | | Stages of parsing |
| reachable: | | Useless rules |
| reachable: | | Useless rules |
| recognizer: | | Stages of parsing |
| recursive: | | Recursion and cycles |
| report item: | | Progress reports |
| RHS: | | Rules |
| RHS (of a rule node): | | Trees |
| right hand side: | | Rules |
| right-recursive: | | Recursion and cycles |
| root node: | | Trees |
| Ruby Slippers: | | Recognizer life cycle mutators |
| rule: | | Rules |
| rule node: | | Trees |
| rule, accessible: | | Rule methods |
| rule, nullable: | | Nulling |
| rule, nullable: | | Rule methods |
| rule, nulling: | | Nulling |
| rule, nulling: | | Rule methods |
| rule, productive: | | Rule methods |
|
S | | |
| scanner: | | Stages of parsing |
| scanning: | | Stages of parsing |
| semantics: | | Parsing theory preliminaries |
| semantics: | | Evaluating a parse |
| 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: | | Traversal |
| 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 |
| success: | | User non-conformity to specified behavior |
| success, Libmarpa application programming: | | User non-conformity to specified behavior |
| successful: | | Derivations |
| symbol: | | Stages of parsing |
| symbol instance, nulled: | | Trees |
| symbol string: | | Parsing theory preliminaries |
| symbol string input: | | Stages of parsing |
| symbol string input: | | Stages of parsing |
| symbol, accessible: | | Symbol methods |
| symbol, counted: | | Sequence methods |
| symbol, nullable: | | Symbol methods |
| symbol, nulling: | | Symbol methods |
| symbol, productive: | | Symbol methods |
| symbol, unvalued: | | What unvalued symbols were |
|
T | | |
| terminal node: | | Trees |
| terminal status (of a symbol): | | LHS terminal methods |
| token node: | | Trees |
| token stream: | | Stages of parsing |
| tokens: | | Stages of parsing |
| trap representations: | | Trap representations |
| trap value: | | Miscellaneous definitions |
| traverser, progress report: | | Progress reports |
| 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 | | |
| undefined behavior: | | Miscellaneous definitions |
| undetected failure: | | Undetected failure |
| unproductive: | | Useless rules |
| unproductive: | | Useless rules |
| unreachable: | | Useless rules |
| unreachable: | | Useless rules |
| unspecified behavior: | | Miscellaneous definitions |
| unspecified value: | | Miscellaneous definitions |
| unvalued symbol: | | What unvalued symbols were |
| us: | | Miscellaneous definitions |
| useless: | | Useless rules |
| useless: | | Useless rules |
| user: | | Miscellaneous definitions |
|
V | | |
| valuator: | | Value overview |
| valuator step: | | Stepping through the valuator |
| valuator step type: | | Stepping through the valuator |
| value: | | Stages of parsing |
| 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 |
| vertex, current (of a progress report traverser): | | Progress reports |
| vertex, next (of a progress report traverser): | | Progress reports |
| vertex, null: | | Progress reports |
|
W | | |
| we: | | Miscellaneous definitions |
|