Grammar name: ____________________________ Number of terminals: _____________________ Number of non-terminals: _________________ Number of rules: _________________________
| Optimization 0 (-O0) | Optimization 1 (-O1) | Optimization 2 (-O2) | Optimization 3 (-O3) | |
| Number of states | ||||
| Number of rules | N/A | N/A | N/A | |
| Number of shift/reduce conflicts | ||||
| Number of reduce/reduce conflicts | ||||
| Number of shift/shift conflicts | N/A | N/A | N/A | |
| Time used (second) | ||||
| Memory used (MB) |
You can attach the grammar if you want to. Thanks.
Send to: chenx AT hawaii DOT edu