General Information
Tutorials
Reference Manuals
Libraries
Translation Tasks
Tools
Administration
|
|
Syntactic Analysis
$- $ modification
- Conflict resolution by ignoring possible structures
&- & marker for actions
- Carrying Out Actions During Parsing
.- `.con' file format
- Grammars for the Specification Files
- `.con' file, example
- Description of the input text, abstracting operators
- `.con' file, purpose
- How to describe a context-free grammar
- `.map' file, example
- Description of the equivalence classes
- `.map' file, format
- Grammars for the Specification Files
- `.perr' file, format
- Grammars for the Specification Files
@- @ modification
- Conflict resolution by ignoring possible structures
A- abstract data type
- Carrying Out Actions During Parsing
- abstracting from literals
- Abstracting information from literals
- accepting a basic symbol
- How the generated parser determines phrase structure
- actions during parsing
- Carrying Out Actions During Parsing
- alternation
- Collecting replacements for the same symbol
- ambiguity
- How to Resolve Parsing Conflicts
- ambiguity resolved by grammar changes
- Conflict resolution by changing the grammar
- ambiguity resolved by modifications
- Conflict resolution by ignoring possible structures
- arbitrary actions during parsing
- Carrying Out Actions During Parsing
- association rules
- Operator associativity
- axiom
- Context-Free Grammars and Parsing
- axiom, recognition of
- How the generated parser determines phrase structure
B- Backus Naur Form
- How to describe a context-free grammar
- basic symbol
-
- basic symbol, how parser accepts
- How the generated parser determines phrase structure
- BNF
- How to describe a context-free grammar
C- C code
- Carrying Out Actions During Parsing
- chain rules
- Chain rule definitions
- coercions
- Chain rule definitions
-
COL
- Supplying coordinates for computation
- `con' file format
- Grammars for the Specification Files
- `con' file, example
- Description of the input text, abstracting operators
- `con' file, purpose
- How to describe a context-free grammar
- conflict
- How to Resolve Parsing Conflicts
- conflict due to user-defined actions
- Carrying Out Actions During Parsing
- conflict solved by $ modification
- The effect of a $-modification
- conflict solved by @ modification
- The effect of a @-modification
- context-free grammar
- Context-Free Grammars and Parsing
-
COORDREF
- Supplying coordinates for computation
D- dangling else problem
- Example of a shift-reduce conflict
- dangling else solved by $ modification
- The effect of a $-modification
- dangling else solved by grammar change
- Conflict resolution by changing the grammar
- declarations, scope issues
- Scope rules for declarations
- derivation
- Context-Free Grammars and Parsing
- dfltrepar.c
- Improving Error Recovery in the Generated Parser
E- empty input text, representation of
- The effect of a @-modification
-
EOF
- The effect of a @-modification
- error reported in a modification
- Conflict resolution by ignoring possible structures
- error reports during parsing
- Context-Free Grammars and Parsing
- exact right context
- Conflict resolution by ignoring possible structures
- example of a reduce-reduce conflict
- Example of a shift-reduce conflict
- example of a shift-reduce conflict
- Example of a shift-reduce conflict
- example of a type-`con' file
- Description of the input text, abstracting operators
- example of a type-`map' file
- Description of the equivalence classes
- example of user-defined actions
- Carrying Out Actions During Parsing
F- file formats
- Grammars for the Specification Files
- finite-state machine
- How the generated parser determines phrase structure
G- grammar
- Context-Free Grammars and Parsing
- grammar changes to resolve ambiguity
- Conflict resolution by changing the grammar
H- halt of the parser
- How the generated parser determines phrase structure
I- Idem and literal chain rules
- Complete generated concrete and abstract syntaxes
- identifier declarations, scope issues
- Scope rules for declarations
- identifier, form of
- Representations of symbols to be replaced
L- left-associative
- Operator associativity
- lexical analyzer
- Representations of character strings
-
LINE
- Supplying coordinates for computation
- list separators
- List Separators
- literal chain rules
- Chain rule definitions
- literal chain rules and Idem
- Complete generated concrete and abstract syntaxes
- literal chain rules, preserving
- Preserving literal chain rules
- Complete generated concrete and abstract syntaxes
- literal, form of
- Representations of character strings
- literals, abstraction from
- Abstracting information from literals
M- `map' file, example
- Description of the equivalence classes
- `map' file, format
- Grammars for the Specification Files
- MAPCHAINS keyword
- Complete generated concrete and abstract syntaxes
- Preserving literal chain rules
- MAPRULE keyword
- Specifying rule mappings
- MAPSYM keyword
- Specifying symbolic equivalence classes
- Maptool
-
- meaning of a construct
- Using structure to convey meaning
- modification specification
- Conflict resolution by ignoring possible structures
- modifications to resolve ambiguity
- Conflict resolution by ignoring possible structures
- move by the parser
- How the generated parser determines phrase structure
- move determined by input symbol
- How the generated parser determines phrase structure
N- node
-
- non-associative
- Operator associativity
- nonterminal symbols in a grammar
- Representations of symbols to be replaced
O- operator
- Mapping expressions for overload resolution
- operator association
- Operator associativity
- operator precedence
- Operator precedence
- overload resolution
- Mapping expressions for overload resolution
P- parser actions
- Carrying Out Actions During Parsing
- parser construction
- Conflict resolution by ignoring possible structures
- parser error reports
- Context-Free Grammars and Parsing
- parser move determined by input symbol
- How the generated parser determines phrase structure
- parser operation
- How the generated parser determines phrase structure
- parsing routine
- Context-Free Grammars and Parsing
- `perr' file, format
- Grammars for the Specification Files
- phrase
-
- phrase structure
- Context-Free Grammars and Parsing
- precedence rules
- Operator precedence
- preserving literal chain rules
- Preserving literal chain rules
- Complete generated concrete and abstract syntaxes
- procedure declaration, scope issues
- Scope rules for declarations
- production
- Context-Free Grammars and Parsing
- progress in recognizing a phrase
- How the generated parser determines phrase structure
R- reduce move by the parser
- How the generated parser determines phrase structure
- reduce-reduce conflict
- How the generated parser determines phrase structure
- reduce-reduce solved by @ modification
- The effect of a @-modification
- repairing syntactic errors
- Context-Free Grammars and Parsing
- Reparatur
- Improving Error Recovery in the Generated Parser
- reported error in a modification
- Conflict resolution by ignoring possible structures
- reports of syntactic errors
- Context-Free Grammars and Parsing
- resolving ambiguity by grammar changes
- Conflict resolution by changing the grammar
- resolving ambiguity by modifications
- Conflict resolution by ignoring possible structures
- resolving ambiguity, general methods
- How to Resolve Parsing Conflicts
- resolving overloading
- Mapping expressions for overload resolution
- restart point
- Improving Error Recovery in the Generated Parser
- reuse of computations
- Abstracting information from literals
- right-associative
- Operator associativity
- root
-
- Rule Mapping
- Specifying rule mappings
- rules, association
- Operator associativity
- rules, precedence
- Operator precedence
S- scope
- Scope rules for declarations
- semantic brackets
- Semantic Brackets
- semantic delimiters
- Semantic Brackets
- semantic disambiguation
- Matching remaining rules
- sentence
-
- sentence symbol
- Context-Free Grammars and Parsing
- sequence
- Context-Free Grammars and Parsing
- shift move by the parser
- How the generated parser determines phrase structure
- shift-reduce conflict
- How the generated parser determines phrase structure
- shift-reduce solved by $ modification
- The effect of a $-modification
- stack of parser states
- How the generated parser determines phrase structure
- state of the parser
- How the generated parser determines phrase structure
- stop after detecting syntax errors
- Improving Error Recovery in the Generated Parser
- STOPAFTERBADPARSE
- Improving Error Recovery in the Generated Parser
- Symbol Mapping
- Specifying symbolic equivalence classes
- syntactic error reports during parsing
- Context-Free Grammars and Parsing
- syntax errors, stop after detecting
- Improving Error Recovery in the Generated Parser
T- terminal
EOF to terminate text
- The effect of a @-modification
- terminal symbols in a grammar
- Representations of character strings
- terminal, use in a modification
- Conflict resolution by ignoring possible structures
- tree computations
- The Relationship Between Phrases and Tree Nodes
- trivial chain rules
- Chain rule definitions
- type-`con' file format
- Grammars for the Specification Files
- type-`con' file, example
- Description of the input text, abstracting operators
- type-`con' file, purpose
- How to describe a context-free grammar
- type-`map' file, example
- Description of the equivalence classes
- type-`map' file, format
- Grammars for the Specification Files
- type-`perr' file, format
- Grammars for the Specification Files
U- user-defined actions during parsing
- Carrying Out Actions During Parsing
|
