|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||
See:
Description
| Class Summary | |
|---|---|
| EndingToken | This token represents the last token in the grammar (the ending node in the
graph.) All the possible ways ends in this token. Control Version 0.0.1 Class creation. 0.0.2 Recommendations from PMD. 0.0.3 Change constant value. 0.0.4 Starting and ending token as constants. 0.0.5 Equals from super. 0.0.6 Equals different super. 1.0.0 Moved to version 1. |
| GraphConstructor | This class builds the graph from the content of the files. |
| GraphToken | This is the representation of a word in the grammar graph. |
| HelpToken | This token shows a little help with the simple commands. Control Version 0.0.1 Class creation. 1.0.0 Moved to version 1. |
| LicenseToken | This token represents the information about the application, like the About
if GUIs. db2sa Copyright (C) 2009 Andres Gomez\nThis program comes with ABSOLUTELY NO WARRANTY;\nThis is free software, and you are welcome to redistribute it\nunder certain conditions. TODO leer la información de licencia y about desde un archivo de configuración para que esté siempre sincronizado y así el usuario pueda conocer la versión que está usando. |
| StartingToken | This token represents the first token in the grammar (the starting node in
the graph.) All the possible ways starts from this token. Control Version 0.0.1 Class creation. 0.0.2 Recommendations from PMD. 0.0.3 Change constant value. 0.0.4 Starting and ending token as constants. 0.0.5 equals from super. 0.0.6 equals different super. 0.0.7 part equals super. 1.0.0 Moved to version 1. |
In this package are all the classes that make the grammar representation. In
this case it is represented by a graph composed by nodes, one starting node,
one ending node and other nodes that represent the commands.
Control Version
|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||
