| File | normalize.str |
| Author | Martin Bravenboer |
| Since | unknown |
Implements simplification to a normalized tree grammar (Section 2.1 TATA)
After applying this transformation every production has thefrom A -> f(A1 ... A2) or A -> f()
| General | |
| Lines of code | 95 |
| Stratego | |
| Module number | 1 (100% documented) |
| Constructor number | 0 |
| Overlay number | 0 |
| Strategy number | 8 (0% documented) |
| Rule number | 3 (33% documented) |
| DynamicRule number | 0 |
Strategy summary |
||
| rtg-remove-nested-trees | n/a | normalize.str |
Rule summary |
||
| rtg-lift-nested-tree | This might introduces duplicate rules, but the remove-inject-rules simplifications turns the productions into a set anyway, so we ignore this | normalize.str |
| rtg-nested-tree-to-nonterm | n/a | normalize.str |
| rtg-remove-injection-rules | n/a | normalize.str |
Rule details |
|||||||||
| ATerm | rtg-lift-nested-tree | ||||||||
This might introduces duplicate rules, but the remove-inject-rules simplifications turns the productions into a set anyway, so weignore this. |
|||||||||