1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
|
/*
* MONA
* Copyright (C) 1997-2013 Aarhus University.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Suite 500, Boston, MA 02110-1335,
* USA.
*/
#ifndef __ENV_H
#define __ENV_H
enum Mode {LINEAR, TREE};
class Options {
public:
Options() :
time(false), whole(false), mode(LINEAR),
statistics(false), printProgress(false),
analysis(false), separateCompilation(false),
dump(false), intermediate(false),
treemodeOutput(false), m2l(false),
graphvizDFA(false), graphvizDAG(false),
graphvizSatisfyingEx(false), graphvizCounterEx(false),
externalWhole(false), demo(false),
inheritedAcceptance(false), unrestrict(false),
alternativeM2LStr(false), reorder(false), optimize(0) {}
bool time;
bool whole;
Mode mode;
bool statistics;
bool printProgress;
bool analysis;
bool separateCompilation;
bool dump;
bool intermediate;
bool treemodeOutput;
bool m2l;
bool graphvizDFA;
bool graphvizDAG;
bool graphvizSatisfyingEx;
bool graphvizCounterEx;
bool externalWhole;
bool demo;
bool inheritedAcceptance;
bool unrestrict;
bool alternativeM2LStr;
bool reorder;
unsigned optimize;
};
#endif
|
