| 1 |
/* Copyright (c) 2006, Sun Microsystems, Inc. |
| 2 |
* All rights reserved. |
| 3 |
* |
| 4 |
* Redistribution and use in source and binary forms, with or without |
| 5 |
* modification, are permitted provided that the following conditions are met: |
| 6 |
* |
| 7 |
* * Redistributions of source code must retain the above copyright notice, |
| 8 |
* this list of conditions and the following disclaimer. |
| 9 |
* * Redistributions in binary form must reproduce the above copyright |
| 10 |
* notice, this list of conditions and the following disclaimer in the |
| 11 |
* documentation and/or other materials provided with the distribution. |
| 12 |
* * Neither the name of the Sun Microsystems, Inc. nor the names of its |
| 13 |
* contributors may be used to endorse or promote products derived from |
| 14 |
* this software without specific prior written permission. |
| 15 |
* |
| 16 |
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| 17 |
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 18 |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 19 |
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
| 20 |
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 21 |
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 22 |
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| 23 |
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| 24 |
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| 25 |
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF |
| 26 |
* THE POSSIBILITY OF SUCH DAMAGE. |
| 27 |
*/ |
| 28 |
|
| 29 |
This version of the GUI parsing example defines the GUI interaction as |
| 30 |
a JavaCC lexical specification where the characters are read from the |
| 31 |
GUI and there is an finite automaton (FA) built out of lexical states |
| 32 |
that have moves on these characters. In the grammar, the |
| 33 |
USER_CHAR_STREAM option is set to true and the BUILD_PARSER option has |
| 34 |
been set to false. The event handler method stuffs the characters into |
| 35 |
a buffer from which characters are returned to the lexical analyzer |
| 36 |
(by readChar). The whole system is invoked through Main.java. |
| 37 |
|
| 38 |
The point of this example is to illustrate: |
| 39 |
|
| 40 |
. A very detailed example of an FA simulation using lexical states |
| 41 |
where every character moves the FA. |
| 42 |
|
| 43 |
. How a lexical analyzer can be used without a standard (JavaCC |
| 44 |
generated) CharStream object. |
| 45 |
|
| 46 |
. How a lexical analyzer can be used without a parser. |
| 47 |
|
| 48 |
. The fact that input can come from entities that are not even streams |
| 49 |
(a GUI in this example). |
| 50 |
|
| 51 |
. That GUI interaction can be modeled as a regular expression |
| 52 |
specification. |
| 53 |
|
| 54 |
To run the calculator (which is what this example implements), do: |
| 55 |
|
| 56 |
javacc CalcInput.jj |
| 57 |
javac *.java |
| 58 |
java Main |
| 59 |
|
| 60 |
Homework: |
| 61 |
|
| 62 |
Simplify the grammar so that (["0"-"9"])* is treated as a single |
| 63 |
entity for moving the FA. |