]>
Commit | Line | Data |
---|---|---|
878ddf1f | 1 | \r |
2 | \r | |
3 | \r | |
4 | dlg(1) PCCTS Manual Pages dlg(1)\r | |
5 | \r | |
6 | \r | |
7 | \r | |
8 | NAME\r | |
9 | dlg - DFA Lexical Analyzer Generator\r | |
10 | \r | |
11 | SYNTAX\r | |
12 | dlg [_\bo_\bp_\bt_\bi_\bo_\bn_\bs] _\bl_\be_\bx_\bi_\bc_\ba_\bl__\bs_\bp_\be_\bc [_\bo_\bu_\bt_\bp_\bu_\bt__\bf_\bi_\bl_\be]\r | |
13 | \r | |
14 | DESCRIPTION\r | |
15 | dlg is a tool that produces fast deterministic finite auto-\r | |
16 | mata for recognizing regular expressions in input.\r | |
17 | \r | |
18 | OPTIONS\r | |
19 | -CC Generate C++ output. The _\bo_\bu_\bt_\bp_\bu_\bt__\bf_\bi_\bl_\be is not specified\r | |
20 | in this case.\r | |
21 | \r | |
22 | -C[ level]\r | |
23 | Where level is the compression level used. 0 indica-\r | |
24 | tions no compression, 1 removes all unused characters\r | |
25 | from the transition from table, and 2 maps equivalent\r | |
26 | characters into the same character classes. It is sug-\r | |
27 | gested that level -C2 is used, since it will signifi-\r | |
28 | cantly reduce the size of the dfa produced for lexical\r | |
29 | analyzer.\r | |
30 | \r | |
31 | -m Produces the header file for the lexical mode with a\r | |
32 | name other than the default name of "mode.h".\r | |
33 | \r | |
34 | -i An interactive, or as interactive as possible, parser\r | |
35 | is produced. A character is only obtained when\r | |
36 | required to decide which state to go to. Some care\r | |
37 | must be taken to obtain accept states that do not\r | |
38 | require look ahead at the next character to determine\r | |
39 | if that is the stop state. Any regular expression with\r | |
40 | a Kleene closure at the end is guaranteed to require\r | |
41 | another character of look ahead.\r | |
42 | \r | |
43 | -cl class\r | |
44 | Specify a class name for DLG to generate. The default\r | |
45 | is DLGLexer.\r | |
46 | \r | |
47 | -ci The automaton will treat upper and lower case charac-\r | |
48 | ters identically. This is accomplished in the automa-\r | |
49 | ton; the characters in the lexical buffer are unmodi-\r | |
50 | fied.\r | |
51 | \r | |
52 | -cs Upper and lower case characters are treated as dis-\r | |
53 | tinct. This is the default.\r | |
54 | \r | |
55 | -o dir\r | |
56 | Directory where output files should go (default=".").\r | |
57 | This is very nice for keeping the source directory\r | |
58 | clear of ANTLR and DLG spawn.\r | |
59 | \r | |
60 | -Wambiguity\r | |
61 | Warns if more than one regular expression could match\r | |
62 | the same character sequence. The warnings give the\r | |
63 | numbers of the expressions in the dlg lexical specifi-\r | |
64 | cation file. The numbering of the expressions starts\r | |
65 | at one. Multiple warnings may be print for the same\r | |
66 | expressions.\r | |
67 | \r | |
68 | - Used in place of file names to get input from standard\r | |
69 | in or send output to standard out.\r | |
70 | \r | |
71 | SPECIAL CONSIDERATIONS\r | |
72 | _\bD_\bl_\bg works... we think. There is no implicit guarantee of\r | |
73 | anything. We reserve no legal rights to the software known\r | |
74 | as the Purdue Compiler Construction Tool Set (PCCTS) - PCCTS\r | |
75 | is in the public domain. An individual or company may do\r | |
76 | whatever they wish with source code distributed with PCCTS\r | |
77 | or the code generated by PCCTS, including the incorporation\r | |
78 | of PCCTS, or its output, into commercial software. We\r | |
79 | encourage users to develop software with PCCTS. However, we\r | |
80 | do ask that credit is given to us for developing PCCTS. By\r | |
81 | "credit", we mean that if you incorporate our source code\r | |
82 | into one of your programs (commercial product, research pro-\r | |
83 | ject, or otherwise) that you acknowledge this fact somewhere\r | |
84 | in the documentation, research report, etc... If you like\r | |
85 | PCCTS and have developed a nice tool with the output, please\r | |
86 | mention that you developed it using PCCTS. As long as these\r | |
87 | guidelines are followed, we expect to continue enhancing\r | |
88 | this system and expect to make other tools available as they\r | |
89 | are completed.\r | |
90 | \r | |
91 | FILES\r | |
92 | mode.h , dlgauto.h , dlgdef.h\r | |
93 | \r | |
94 | SEE ALSO\r | |
95 | antlr(1), pccts(1)\r | |
96 | \r | |
97 | BUGS\r | |
98 | \r | |
99 | \r | |
100 | \r | |
101 | \r | |
102 | \r | |
103 | \r | |
104 | \r | |
105 | \r | |
106 | \r | |
107 | \r | |
108 | \r | |
109 | \r | |
110 | \r | |
111 | \r | |
112 | \r | |
113 | \r | |
114 | \r | |
115 | \r | |
116 | \r | |
117 | \r | |
118 | \r | |
119 | \r | |
120 | \r | |
121 | \r | |
122 | \r | |
123 | \r | |
124 | \r | |
125 | \r | |
126 | \r | |
127 | \r | |
128 | \r | |
129 | \r | |
130 | \r | |
131 | \r | |
132 | \r |