"(our rules) have conditions of applicability and parameters, which productions do not permit. Furthermore, grammars are typically used by parsers to find one sequence of terminals that match an input stream of tokens, whereas we wish to generate all such sequences."
| 4. Related Work: |
<System R>
<Bottom Up>
<Join Order Heuristics>
<Query Blocks>
<Rules>
<Top Down>
<Volcano>
<Phases>
<Specialized Techniques>
<Unique Rules>
4.1: Left-Deep |
|---|
|
|