Diction and typos.
Chris Pressey
10 months ago
76 | 76 |
|
77 | 77 |
### Semantics
|
78 | 78 |
|
79 | |
* Figure out how to get data structures (strings (terminals) and
|
|
79 |
* Implement getting data structures (strings (terminals) and
|
80 | 80 |
dictionaries (feature structures), at a minimum) into the context
|
81 | 81 |
and referenceable in constraints. Handle dictionaries during
|
82 | 82 |
unification in the way that feature structures are conventionally
|
83 | |
handled in unificiation.
|
|
83 |
handled in unification.
|
84 | 84 |
|
85 | 85 |
### Implementation
|
86 | 86 |
|
585 | 585 |
Goal ::= <. a = 3 .> <. h = 3 .> <. l = 3 .> <. a >= l .> <. a <= h .> "a";
|
586 | 586 |
===> a
|
587 | 587 |
|
588 | |
The above demonstrates terminals, but actually an entire production expression can appear
|
589 | |
in the constraint.
|
590 | |
|
591 | 588 |
#### Lookahead assertions
|
592 | 589 |
|
593 | 590 |
Lookahead assertions can't be used when generating.
|