-
Notifications
You must be signed in to change notification settings - Fork 0
PMLA
Ömercan Yazici edited this page Mar 18, 2016
·
2 revisions
The PMLA (ParMaLy - Analyzer) is a general only on grammar based analyzer which also can preprocess grammar files and generate optimized versions of those.
| Short | Long | Input | Description | Example |
|---|---|---|---|---|
| -h | --help | PMLA shows the help message and exits. | PMLA -h |
|
| -nl | --no-log | PMLA will surpress the generation of the log file. | PMLA grammar.g -nl -k=2 --firstset=firstset.txt |
|
| -k | --lookahead | INT | Sets the amount of lookahead to be used. Can be higher or equal 0. | PMLA grammar.g -k=4 --firstset=firstset.txt |
| -o | --output | PATH | Sets the path to the resulting grammar file after preprocessing. | PMLA grammar.g --left-recursion -o=output.g |
| --style | PATH | Sets the style configuration file to be used by all output. | PMLA grammar.g --firstset=firstset.txt --style=style.style |
| Short | Long | Input | Description | Example |
|---|---|---|---|---|
| --breakdown | PATH | Will generate a general breakdown of the grammar. | PMLA grammar.g --breakdown=breakdown.txt |
|
| --group-dot | PATH | Will generate a DOT file representing the rule group connection graph. | PMLA grammar.g --group-dot=groups.dot |
|
| --firstset | PATH | Will generate a file containing all firstsets for K lookaheads for all rule groups. | PMLA grammar.g -k=2 --firstset=firstset.txt |
|
| --followset | PATH | Will generate a file containing all followsets for K lookaheads for all rule groups. | PMLA grammar.g -k=2 --followset=followset.txt |
|
| --predictset | PATH | Will generate a file containing all predictsets for K lookaheads for all rule groups. | PMLA grammar.g -k=2 --predictset=predictset.txt |
| Short | Long | Input | Description | Example |
|---|---|---|---|---|
| --left-recursion | Will try to fix potential left-recursions. | PMLA grammar.g --left-recursion -o=output.g |