public static int curLine, curCol; // position of curCh
public static void MiniCppLexMethod(Utils.ModuleAction action, out String moduleName)
{
//-----------------------------------|----------------------------------------
moduleName = MODULENAME;
switch (action)
{
case Utils.ModuleAction.getModuleName:
return;
case Utils.ModuleAction.initModule:
caseSensitive = true;
lt = new LexicalTable();
tokenStrArr = new char[256];
kwHt = CreateHashtable();
nHt = CreateHashtable();
nl = new ArrayList();
break;
case Utils.ModuleAction.resetModule:
kwHt.Clear();
nHt.Clear();
nl.Clear();
break;
case Utils.ModuleAction.cleanupModule:
lt = null;
tokenStrArr = null;
kwHt = null;
nHt = null;
nl = null;
break;
} // switch
} // MiniCppLexMethod
public static int curLine, curCol; // position of curCh
public static void BinaryTreeLexMethod(Utils.ModuleAction action, out String moduleName) {
//-----------------------------------|----------------------------------------
moduleName = MODULENAME;
switch (action) {
case Utils.ModuleAction.getModuleName:
return;
case Utils.ModuleAction.initModule:
caseSensitive = true;
lt = new LexicalTable();
tokenStrArr = new char[256];
kwHt = CreateHashtable();
nHt = CreateHashtable();
nl = new ArrayList();
break;
case Utils.ModuleAction.resetModule:
kwHt.Clear();
nHt.Clear();
nl.Clear();
break;
case Utils.ModuleAction.cleanupModule:
lt = null;
tokenStrArr = null;
kwHt = null;
nHt = null;
nl = null;
break;
} // switch
} // BinaryTreeLexMethod
