Datasets:

h4iku

/

coconut_java2006_preprocessed

like 1

invalidate(); repaint();

rosterGroup.setName(newName);

public void actionPerformed(ActionEvent e) { int ok = JOptionPane.showConfirmDialog(group, "Are you sure you want to delete \"" + group.getGroupName() + "\"", "Delete Confirmation", JOptionPane.YES_NO_OPTION, JOptionPane.QUESTION_MESSAGE); if (ok == JOptionPane.YES_OPTION) { String groupName = group.getGroupName(); Roster roster = SparkManager.getConnection().getRoster(); RosterGroup rosterGroup = roster.getGroup(groupName); if (rosterGroup != null) { Iterator entries = rosterGroup.getEntries(); while (entries.hasNext()) { RosterEntry entry = (RosterEntry)entries.next(); try { rosterGroup.removeEntry(entry); } catch (XMPPException e1) { Log.error("Error removing entry", e1); } } } // Remove from UI removeContactGroup(group); invalidate(); repaint(); } }

RosterEntry entry = roster.getEntry(jid); addUser(entry);

RosterEntry rosterEntry = roster.getEntry(jid); if (rosterEntry != null) { Iterator rosterGroups = rosterEntry.getGroups(); boolean isUnfiled = true; while (rosterGroups.hasNext()) { isUnfiled = false; RosterGroup group = (RosterGroup)rosterGroups.next(); if (getContactGroup(group.getName()) == null) { ContactGroup contactGroup = new ContactGroup(group.getName()); contactGroup.setVisible(false); addContactGroup(contactGroup); contactGroup = getContactGroup(group.getName()); String name = rosterEntry.getName(); if (name == null) { name = rosterEntry.getUser(); } ContactItem contactItem = new ContactItem(name, rosterEntry.getUser()); contactGroup.addContactItem(contactItem); Presence presence = roster.getPresence(jid); contactItem.setPresence(presence); if (presence != null) { contactGroup.setVisible(true); } } else { ContactGroup contactGroup = getContactGroup(group.getName()); ContactItem item = contactGroup.getContactItemByJID(jid); if (item == null) { String name = rosterEntry.getName(); if (name == null) { name = rosterEntry.getUser(); } item = new ContactItem(name, rosterEntry.getUser()); Presence presence = roster.getPresence(jid); item.setPresence(presence); if (presence != null) { contactGroup.addContactItem(item); contactGroup.fireContactGroupUpdated(); } } else { Presence presence = roster.getPresence(jid); item.setPresence(presence); updateUserPresence(presence); contactGroup.fireContactGroupUpdated(); } } } Set groupSet = new HashSet(); jids = addresses.iterator(); while (jids.hasNext()) { jid = (String)jids.next(); rosterEntry = roster.getEntry(jid); Iterator groups = rosterEntry.getGroups(); while (groups.hasNext()) { RosterGroup g = (RosterGroup)groups.next(); groupSet.add(g.getName()); } for (ContactGroup group : new ArrayList<ContactGroup>(getContactGroups())) { if (group.getContactItemByJID(jid) != null && group != unfiledGroup && group != offlineGroup) { if (!groupSet.contains(group.getGroupName())) { removeContactGroup(group); } } } } if (!isUnfiled) { return; } ContactItem unfiledItem = unfiledGroup.getContactItemByJID(jid); if (unfiledItem != null) { } else { ContactItem offlineItem = offlineGroup.getContactItemByJID(jid); if (offlineItem != null) { if ((rosterEntry.getType() == RosterPacket.ItemType.NONE || rosterEntry.getType() == RosterPacket.ItemType.FROM) && RosterPacket.ItemStatus.SUBSCRIPTION_PENDING == rosterEntry.getStatus()) { offlineGroup.removeContactItem(offlineItem); unfiledGroup.addContactItem(offlineItem); unfiledGroup.fireContactGroupUpdated(); unfiledGroup.setVisible(true); } } } }

public void run() { Roster roster = SparkManager.getConnection().getRoster(); Iterator jids = addresses.iterator(); while (jids.hasNext()) { String jid = (String)jids.next(); RosterEntry entry = roster.getEntry(jid); addUser(entry); } }

Roster roster = SparkManager.getConnection().getRoster();

public void run() { Roster roster = SparkManager.getConnection().getRoster(); Iterator jids = addresses.iterator(); while (jids.hasNext()) { String jid = (String)jids.next(); RosterEntry rosterEntry = roster.getEntry(jid); if (rosterEntry != null) { // Check for new Roster Groups and add them if they do not exist. Iterator rosterGroups = rosterEntry.getGroups(); boolean isUnfiled = true; while (rosterGroups.hasNext()) { isUnfiled = false; RosterGroup group = (RosterGroup)rosterGroups.next(); // Handle if this is a new Entry in a new Group. if (getContactGroup(group.getName()) == null) { // Create group. ContactGroup contactGroup = new ContactGroup(group.getName()); contactGroup.setVisible(false); addContactGroup(contactGroup); contactGroup = getContactGroup(group.getName()); String name = rosterEntry.getName(); if (name == null) { name = rosterEntry.getUser(); } ContactItem contactItem = new ContactItem(name, rosterEntry.getUser()); contactGroup.addContactItem(contactItem); Presence presence = roster.getPresence(jid); contactItem.setPresence(presence); if (presence != null) { contactGroup.setVisible(true); } } else { ContactGroup contactGroup = getContactGroup(group.getName()); ContactItem item = contactGroup.getContactItemByJID(jid); // Check to see if this entry is new to a pre-existing group. if (item == null) { String name = rosterEntry.getName(); if (name == null) { name = rosterEntry.getUser(); } item = new ContactItem(name, rosterEntry.getUser()); Presence presence = roster.getPresence(jid); item.setPresence(presence); if (presence != null) { contactGroup.addContactItem(item); contactGroup.fireContactGroupUpdated(); } } // If not, just update their presence. else { Presence presence = roster.getPresence(jid); item.setPresence(presence); updateUserPresence(presence); contactGroup.fireContactGroupUpdated(); } } } // Now check to see if groups have been modified or removed. This is used // to check if Contact Groups have been renamed or removed. Set groupSet = new HashSet(); jids = addresses.iterator(); while (jids.hasNext()) { jid = (String)jids.next(); rosterEntry = roster.getEntry(jid); Iterator groups = rosterEntry.getGroups(); while (groups.hasNext()) { RosterGroup g = (RosterGroup)groups.next(); groupSet.add(g.getName()); } for (ContactGroup group : new ArrayList<ContactGroup>(getContactGroups())) { if (group.getContactItemByJID(jid) != null && group != unfiledGroup && group != offlineGroup) { if (!groupSet.contains(group.getGroupName())) { removeContactGroup(group); } } } } if (!isUnfiled) { return; } ContactItem unfiledItem = unfiledGroup.getContactItemByJID(jid); if (unfiledItem != null) { } else { ContactItem offlineItem = offlineGroup.getContactItemByJID(jid); if (offlineItem != null) { if ((rosterEntry.getType() == RosterPacket.ItemType.NONE || rosterEntry.getType() == RosterPacket.ItemType.FROM) && RosterPacket.ItemStatus.SUBSCRIPTION_PENDING == rosterEntry.getStatus()) { // Remove from offlineItem and add to unfiledItem. offlineGroup.removeContactItem(offlineItem); unfiledGroup.addContactItem(offlineItem); unfiledGroup.fireContactGroupUpdated(); unfiledGroup.setVisible(true); } } } } } }

RosterEntry rosterEntry = roster.getEntry(jid); if (rosterEntry != null) { Iterator rosterGroups = rosterEntry.getGroups(); boolean isUnfiled = true; while (rosterGroups.hasNext()) { isUnfiled = false; RosterGroup group = (RosterGroup)rosterGroups.next(); if (getContactGroup(group.getName()) == null) { ContactGroup contactGroup = new ContactGroup(group.getName()); contactGroup.setVisible(false); addContactGroup(contactGroup); contactGroup = getContactGroup(group.getName()); String name = rosterEntry.getName(); if (name == null) { name = rosterEntry.getUser(); } ContactItem contactItem = new ContactItem(name, rosterEntry.getUser()); contactGroup.addContactItem(contactItem); Presence presence = roster.getPresence(jid); contactItem.setPresence(presence); if (presence != null) { contactGroup.setVisible(true); } } else { ContactGroup contactGroup = getContactGroup(group.getName()); ContactItem item = contactGroup.getContactItemByJID(jid); if (item == null) { String name = rosterEntry.getName(); if (name == null) { name = rosterEntry.getUser(); } item = new ContactItem(name, rosterEntry.getUser()); Presence presence = roster.getPresence(jid); item.setPresence(presence); if (presence != null) { contactGroup.addContactItem(item); contactGroup.fireContactGroupUpdated(); } } else { Presence presence = roster.getPresence(jid); item.setPresence(presence); updateUserPresence(presence); contactGroup.fireContactGroupUpdated(); } } } Set groupSet = new HashSet(); jids = addresses.iterator(); while (jids.hasNext()) { jid = (String)jids.next(); rosterEntry = roster.getEntry(jid); Iterator groups = rosterEntry.getGroups(); while (groups.hasNext()) { RosterGroup g = (RosterGroup)groups.next(); groupSet.add(g.getName()); } for (ContactGroup group : new ArrayList<ContactGroup>(getContactGroups())) { if (group.getContactItemByJID(jid) != null && group != unfiledGroup && group != offlineGroup) { if (!groupSet.contains(group.getGroupName())) { removeContactGroup(group); } } } } if (!isUnfiled) { return; } ContactItem unfiledItem = unfiledGroup.getContactItemByJID(jid); if (unfiledItem != null) { } else { ContactItem offlineItem = offlineGroup.getContactItemByJID(jid); if (offlineItem != null) { if ((rosterEntry.getType() == RosterPacket.ItemType.NONE || rosterEntry.getType() == RosterPacket.ItemType.FROM) && RosterPacket.ItemStatus.SUBSCRIPTION_PENDING == rosterEntry.getStatus()) { offlineGroup.removeContactItem(offlineItem); unfiledGroup.addContactItem(offlineItem); unfiledGroup.fireContactGroupUpdated(); unfiledGroup.setVisible(true); } } } }

removeContactItem(jid);

public void run() { Roster roster = SparkManager.getConnection().getRoster(); Iterator jids = addresses.iterator(); while (jids.hasNext()) { String jid = (String)jids.next(); RosterEntry rosterEntry = roster.getEntry(jid); if (rosterEntry != null) { // Check for new Roster Groups and add them if they do not exist. Iterator rosterGroups = rosterEntry.getGroups(); boolean isUnfiled = true; while (rosterGroups.hasNext()) { isUnfiled = false; RosterGroup group = (RosterGroup)rosterGroups.next(); // Handle if this is a new Entry in a new Group. if (getContactGroup(group.getName()) == null) { // Create group. ContactGroup contactGroup = new ContactGroup(group.getName()); contactGroup.setVisible(false); addContactGroup(contactGroup); contactGroup = getContactGroup(group.getName()); String name = rosterEntry.getName(); if (name == null) { name = rosterEntry.getUser(); } ContactItem contactItem = new ContactItem(name, rosterEntry.getUser()); contactGroup.addContactItem(contactItem); Presence presence = roster.getPresence(jid); contactItem.setPresence(presence); if (presence != null) { contactGroup.setVisible(true); } } else { ContactGroup contactGroup = getContactGroup(group.getName()); ContactItem item = contactGroup.getContactItemByJID(jid); // Check to see if this entry is new to a pre-existing group. if (item == null) { String name = rosterEntry.getName(); if (name == null) { name = rosterEntry.getUser(); } item = new ContactItem(name, rosterEntry.getUser()); Presence presence = roster.getPresence(jid); item.setPresence(presence); if (presence != null) { contactGroup.addContactItem(item); contactGroup.fireContactGroupUpdated(); } } // If not, just update their presence. else { Presence presence = roster.getPresence(jid); item.setPresence(presence); updateUserPresence(presence); contactGroup.fireContactGroupUpdated(); } } } // Now check to see if groups have been modified or removed. This is used // to check if Contact Groups have been renamed or removed. Set groupSet = new HashSet(); jids = addresses.iterator(); while (jids.hasNext()) { jid = (String)jids.next(); rosterEntry = roster.getEntry(jid); Iterator groups = rosterEntry.getGroups(); while (groups.hasNext()) { RosterGroup g = (RosterGroup)groups.next(); groupSet.add(g.getName()); } for (ContactGroup group : new ArrayList<ContactGroup>(getContactGroups())) { if (group.getContactItemByJID(jid) != null && group != unfiledGroup && group != offlineGroup) { if (!groupSet.contains(group.getGroupName())) { removeContactGroup(group); } } } } if (!isUnfiled) { return; } ContactItem unfiledItem = unfiledGroup.getContactItemByJID(jid); if (unfiledItem != null) { } else { ContactItem offlineItem = offlineGroup.getContactItemByJID(jid); if (offlineItem != null) { if ((rosterEntry.getType() == RosterPacket.ItemType.NONE || rosterEntry.getType() == RosterPacket.ItemType.FROM) && RosterPacket.ItemStatus.SUBSCRIPTION_PENDING == rosterEntry.getStatus()) { // Remove from offlineItem and add to unfiledItem. offlineGroup.removeContactItem(offlineItem); unfiledGroup.addContactItem(offlineItem); unfiledGroup.fireContactGroupUpdated(); unfiledGroup.setVisible(true); } } } } } }

viewOnline.setSelected(show); if (showHideMenu.isSelected()) { viewOnline.setToolTipText("Hide Empty Groups"); } else { viewOnline.setToolTipText("Show Empty Groups"); }

private void showEmptyGroups(boolean show) { Iterator contactGroups = getContactGroups().iterator(); while (contactGroups.hasNext()) { ContactGroup group = (ContactGroup)contactGroups.next(); if (show) { group.setVisible(true); } else { // Never hide offline group. if (group != offlineGroup) { group.setVisible(group.hasAvailableContacts()); } } } localPreferences.setEmptyGroupsShown(show); showHideMenu.setSelected(show); viewOnline.setSelected(show); if (showHideMenu.isSelected()) { viewOnline.setToolTipText("Hide Empty Groups"); } else { viewOnline.setToolTipText("Show Empty Groups"); } }

VCardManager vcardSupport = SparkManager.getVCardManager(); String jid = item.getFullJID(); vcardSupport.viewProfile(jid, SparkManager.getWorkspace());

JEditorPane pane = new JEditorPane(); StringBuffer buf = new StringBuffer(); Collection col = item.getPresenceHistory(); Iterator iter = col.iterator(); while (iter.hasNext()) { String history = (String)iter.next(); buf.append(history + "\n"); } pane.setText(buf.toString()); MessageDialog.showComponent("Presence History", "History of user activity while online.", SparkRes.getImageIcon(SparkRes.INFORMATION_IMAGE), new JScrollPane(pane), getGUI(), 400, 400, false);

public void actionPerformed(ActionEvent e) { VCardManager vcardSupport = SparkManager.getVCardManager(); String jid = item.getFullJID(); vcardSupport.viewProfile(jid, SparkManager.getWorkspace()); }

public void actionPerformed(ActionEvent e) { JEditorPane pane = new JEditorPane(); StringBuffer buf = new StringBuffer(); Collection col = item.getPresenceHistory(); Iterator iter = col.iterator(); while (iter.hasNext()) { String history = (String)iter.next(); buf.append(history + "\n");

public void actionPerformed(ActionEvent actionEvent) { try { LastActivity activity = LastActivity.getLastActivity(SparkManager.getConnection(), item.getFullJID()); long idleTime = (activity.getIdleTime() * 1000); String time = ModelUtil.getTimeFromLong(idleTime); JOptionPane.showMessageDialog(getGUI(), "Idle for " + time, "Last Activity", JOptionPane.INFORMATION_MESSAGE);

public void actionPerformed(ActionEvent e) { JEditorPane pane = new JEditorPane(); StringBuffer buf = new StringBuffer(); Collection col = item.getPresenceHistory(); Iterator iter = col.iterator(); while (iter.hasNext()) { String history = (String)iter.next(); buf.append(history + "\n"); } pane.setText(buf.toString()); MessageDialog.showComponent("Presence History", "History of user activity while online.", SparkRes.getImageIcon(SparkRes.INFORMATION_IMAGE), new JScrollPane(pane), getGUI(), 400, 400, false); }

pane.setText(buf.toString()); MessageDialog.showComponent("Presence History", "History of user activity while online.", SparkRes.getImageIcon(SparkRes.INFORMATION_IMAGE), new JScrollPane(pane), getGUI(), 400, 400, false);

catch (XMPPException e1) { }

public void actionPerformed(ActionEvent e) { JEditorPane pane = new JEditorPane(); StringBuffer buf = new StringBuffer(); Collection col = item.getPresenceHistory(); Iterator iter = col.iterator(); while (iter.hasNext()) { String history = (String)iter.next(); buf.append(history + "\n"); } pane.setText(buf.toString()); MessageDialog.showComponent("Presence History", "History of user activity while online.", SparkRes.getImageIcon(SparkRes.INFORMATION_IMAGE), new JScrollPane(pane), getGUI(), 400, 400, false); }

public void actionPerformed(ActionEvent actionEvent) { try { LastActivity activity = LastActivity.getLastActivity(SparkManager.getConnection(), item.getFullJID()); long idleTime = (activity.getIdleTime() * 1000); String time = ModelUtil.getTimeFromLong(idleTime); JOptionPane.showMessageDialog(getGUI(), "Idle for " + time, "Last Activity", JOptionPane.INFORMATION_MESSAGE); } catch (XMPPException e1) { }

public void actionPerformed(ActionEvent e) { String jid = item.getFullJID(); Presence response = new Presence(Presence.Type.SUBSCRIBE); response.setTo(jid);

public void actionPerformed(ActionEvent actionEvent) { try { LastActivity activity = LastActivity.getLastActivity(SparkManager.getConnection(), item.getFullJID()); long idleTime = (activity.getIdleTime() * 1000); String time = ModelUtil.getTimeFromLong(idleTime); JOptionPane.showMessageDialog(getGUI(), "Idle for " + time, "Last Activity", JOptionPane.INFORMATION_MESSAGE); } catch (XMPPException e1) { } }

SparkManager.getConnection().sendPacket(response);

public void actionPerformed(ActionEvent actionEvent) { try { LastActivity activity = LastActivity.getLastActivity(SparkManager.getConnection(), item.getFullJID()); long idleTime = (activity.getIdleTime() * 1000); String time = ModelUtil.getTimeFromLong(idleTime); JOptionPane.showMessageDialog(getGUI(), "Idle for " + time, "Last Activity", JOptionPane.INFORMATION_MESSAGE); } catch (XMPPException e1) { } }

String jid = item.getFullJID(); Presence response = new Presence(Presence.Type.SUBSCRIBE); response.setTo(jid); SparkManager.getConnection().sendPacket(response);

sendMessages(items);

public void actionPerformed(ActionEvent e) { String jid = item.getFullJID(); Presence response = new Presence(Presence.Type.SUBSCRIBE); response.setTo(jid); SparkManager.getConnection().sendPacket(response); }

Presence response = new Presence(Presence.Type.SUBSCRIBED); response.setTo(jid); SparkManager.getConnection().sendPacket(response); int ok = JOptionPane.showConfirmDialog(getGUI(), "Would you like to add the user to your roster?", "Add To Roster", JOptionPane.YES_NO_OPTION, JOptionPane.QUESTION_MESSAGE); if (ok == JOptionPane.OK_OPTION) { RosterDialog rosterDialog = new RosterDialog(); rosterDialog.setDefaultJID(jid); rosterDialog.showRosterDialog(); }

public void actionPerformed(ActionEvent e) { dialog.dispose(); Presence response = new Presence(Presence.Type.SUBSCRIBED); response.setTo(jid); SparkManager.getConnection().sendPacket(response); int ok = JOptionPane.showConfirmDialog(getGUI(), "Would you like to add the user to your roster?", "Add To Roster", JOptionPane.YES_NO_OPTION, JOptionPane.QUESTION_MESSAGE); if (ok == JOptionPane.OK_OPTION) { RosterDialog rosterDialog = new RosterDialog(); rosterDialog.setDefaultJID(jid); rosterDialog.showRosterDialog(); } }

Presence response = new Presence(Presence.Type.UNSUBSCRIBE); response.setTo(jid); SparkManager.getConnection().sendPacket(response); dialog.dispose();

SparkManager.getVCardManager().viewProfile(jid, getGUI());

public void actionPerformed(ActionEvent e) { // Send subscribed Presence response = new Presence(Presence.Type.UNSUBSCRIBE); response.setTo(jid); SparkManager.getConnection().sendPacket(response); dialog.dispose(); }

Map newMap = new HashMap(emotionMap);

Map<String,String> newMap = new HashMap<String,String>(emotionMap);

public static Map getEmoticonMap() { Map newMap = new HashMap(emotionMap); newMap.remove("8-)"); newMap.remove("|-)"); newMap.remove("<:o)"); newMap.remove(":-)"); return newMap; }

public static final ImageIcon getImageIcon(String face) { final String value = (String)emotionMap.get(face);

public static ImageIcon getImageIcon(String face) { final String value = emotionMap.get(face);

public static final ImageIcon getImageIcon(String face) { final String value = (String)emotionMap.get(face); if (value != null) { final URL url = cl.getResource(value); if (url != null) { return new ImageIcon(url); } } return null; }

public static final URL getURL(String face) { final String value = (String)emotionMap.get(face);

public static URL getURL(String face) { final String value = emotionMap.get(face);

public static final URL getURL(String face) { final String value = (String)emotionMap.get(face); if (value != null) { final URL url = cl.getResource(value); if (url != null) { return url; } } return null; }

JScrollBar sb = textScroller.getVerticalScrollBar(); sb.setValue(sb.getMaximum());

public void scrollToBottom() { if (mousePressed) { return; } int chatLength = transcriptWindow.getDocument().getLength(); transcriptWindow.setCaretPosition(chatLength); }

assertTrue(packageData.contains(classData.getBaseName()));

assertTrue(packageData.contains(classData.getSourceFileName())); sourceFileData = (SourceFileData)packageData.getChild(classData .getSourceFileName()); assertTrue(sourceFileData.contains(classData.getBaseName()));

public void testAddClass() { ClassData classData; assertEquals(0, packageData.getNumberOfChildren()); classData = new ClassData("com.example.HelloWorld"); classData.setSourceFileName("com/example/HelloWorld.java"); for (int i = 0; i < 10; i++) classData.addLine(i, "test", "(I)B"); packageData.addClassData(classData); assertEquals(1, packageData.getNumberOfChildren()); assertTrue(packageData.contains(classData.getBaseName())); classData = new ClassData("com.example.HelloWorldHelper"); classData.setSourceFileName("com/example/HelloWorldHelper.java"); for (int i = 0; i < 14; i++) classData.addLine(i, "test", "(I)B"); packageData.addClassData(classData); assertEquals(2, packageData.getNumberOfChildren()); assertTrue(packageData.contains(classData.getBaseName())); // See what happens when we try to add the same class twice classData = new ClassData("com.example.HelloWorld"); classData.setSourceFileName("com/example/HelloWorld.java"); for (int i = 0; i < 19; i++) classData.addLine(i, "test", "(I)B"); try { packageData.addClassData(classData); // removed by Jeremy Thomerson when changing PackageData // fail("Expected an IllegalArgumentException but did not receive one!"); } catch (IllegalArgumentException e) { // Good! } assertEquals(2, packageData.getNumberOfChildren()); }

SortedSet sourceFiles;

Collection sourceFiles;

private void generateSourceFileList(PackageData packageData) throws IOException { String filename; SortedSet sourceFiles; if (packageData == null) { filename = "frame-sourcefiles.html"; sourceFiles = projectData.getSourceFiles(); } else { filename = "frame-sourcefiles-" + packageData.getName() + ".html"; sourceFiles = packageData.getSourceFiles(); } // sourceFiles is sorted, but it's sorted by the full path // to the file, and we only want to sort based on the // file's basename. Vector sortedSourceFiles = new Vector(); sortedSourceFiles.addAll(sourceFiles); Collections.sort(sortedSourceFiles, new SourceFileDataBaseNameComparator()); File file = new File(destinationDir, filename); PrintStream out = null; try { out = new PrintStream(new FileOutputStream(file)); out.println("<html>"); out.println("<head>"); out.println("<title>Coverage Report Classes</title>"); out .println("<link title=\"Style\" type=\"text/css\" rel=\"stylesheet\" href=\"css/main.css\" />"); out.println("</head>"); out.println("<body>"); out.println("<h5>"); out.println(packageData == null ? "All Packages" : generatePackageName(packageData)); out.println("</h5>"); out.println("<h5>Classes</h5>"); out.println("<table width=\"100%\">"); for (Iterator iter = sortedSourceFiles.iterator(); iter .hasNext();) { SourceFileData sourceFileData = (SourceFileData)iter.next(); out.println("<tr>"); String percentCovered; if (sourceFileData.getNumberOfValidLines() > 0) percentCovered = getPercentValue(sourceFileData .getLineCoverageRate()); else percentCovered = "N/A"; out .println("<td nowrap=\"nowrap\"><a target=\"summary\" href=\"" + sourceFileData.getNormalizedName() + ".html\">" + sourceFileData.getBaseName() + "</a> <i>(" + percentCovered + ")</i></td>"); out.println("</tr>"); } out.println("</td>"); out.println("</tr>"); out.println("</table>"); out.println("</body>"); out.println("</html>"); } finally { if (out != null) { out.close(); } } }

ret.append("<td class=\"value\">" + projectData.getNumberOfClasses()

ret.append("<td class=\"value\">" + projectData.getNumberOfSourceFiles()

private String generateTableRowForTotal() { StringBuffer ret = new StringBuffer(); double lineCoverage = -1; double branchCoverage = -1; double ccn = Util.getCCN(sourceDir, true); if (projectData.getNumberOfValidLines() > 0) lineCoverage = projectData.getLineCoverageRate(); if (projectData.getNumberOfValidBranches() > 0) branchCoverage = projectData.getBranchCoverageRate(); ret.append(" <tr>"); ret.append("<td class=\"text\"><b>All Packages</b></td>"); ret.append("<td class=\"value\">" + projectData.getNumberOfClasses() + "</td>"); ret.append(generateTableColumnsFromData(lineCoverage, branchCoverage, ccn)); ret.append("</tr>"); return ret.toString(); }

delay = localPref.getIdleTime() * 6000;

delay = localPref.getIdleTime() * 60000;

private void setIdleListener() throws Exception { final Timer timer = new Timer(); timer.scheduleAtFixedRate(new TimerTask() { public void run() { LocalPreferences localPref = SettingsManager.getLocalPreferences(); int delay = 0; if (localPref.isIdleOn()) { delay = localPref.getIdleTime() * 6000; } else { return; } long idleTime = SystemInfo.getSessionIdleTime(); boolean isLocked = SystemInfo.isSessionLocked(); if (idleTime > delay) { try { // Handle if spark is not connected to the server. if (SparkManager.getConnection() == null || !SparkManager.getConnection().isConnected()) { return; } // Change Status Workspace workspace = SparkManager.getWorkspace(); Presence presence = workspace.getStatusBar().getPresence(); if (workspace != null && presence.getMode() == Presence.Mode.available) { unavaliable = true; StatusItem away = workspace.getStatusBar().getStatusItem("Away"); Presence p = away.getPresence(); if (isLocked) { p.setStatus(Res.getString("message.locked.workstation")); } else { p.setStatus(Res.getString("message.away.idle")); } previousPriority = presence.getPriority(); p.setPriority(0); SparkManager.getSessionManager().changePresence(p); } } catch (Exception e) { Log.error("Error with IDLE status.", e); timer.cancel(); } } else { if (unavaliable) { setAvailableIfActive(); } } } }, 1000, 1000); }

delay = localPref.getIdleTime() * 6000;

delay = localPref.getIdleTime() * 60000;

public void run() { LocalPreferences localPref = SettingsManager.getLocalPreferences(); int delay = 0; if (localPref.isIdleOn()) { delay = localPref.getIdleTime() * 6000; } else { return; } long idleTime = SystemInfo.getSessionIdleTime(); boolean isLocked = SystemInfo.isSessionLocked(); if (idleTime > delay) { try { // Handle if spark is not connected to the server. if (SparkManager.getConnection() == null || !SparkManager.getConnection().isConnected()) { return; } // Change Status Workspace workspace = SparkManager.getWorkspace(); Presence presence = workspace.getStatusBar().getPresence(); if (workspace != null && presence.getMode() == Presence.Mode.available) { unavaliable = true; StatusItem away = workspace.getStatusBar().getStatusItem("Away"); Presence p = away.getPresence(); if (isLocked) { p.setStatus(Res.getString("message.locked.workstation")); } else { p.setStatus(Res.getString("message.away.idle")); } previousPriority = presence.getPriority(); p.setPriority(0); SparkManager.getSessionManager().changePresence(p); } } catch (Exception e) { Log.error("Error with IDLE status.", e); timer.cancel(); } } else { if (unavaliable) { setAvailableIfActive(); } } }

if (descriptor.dirClass == null) descriptor.dirClass = directive;

public final void register(String dirClassName) throws IntrospectionException, InitException { Class directive = null; DirectiveDescriptor descriptor, oldDesc; try { directive = Class.forName(dirClassName); } catch (Exception e) { throw new IntrospectionException("No class " + dirClassName); } // Make sure this class is an instance of o.w.directive.Directive if (Directive.class.isAssignableFrom(directive)) { try { descriptor = (DirectiveDescriptor) directive.getMethod("getDescriptor", null).invoke(null, null); } catch (Exception e) { throw new IntrospectionException("Class " + dirClassName + " does not have a getDescriptor() method"); } oldDesc = (DirectiveDescriptor) _descriptors.get(descriptor.name); if (oldDesc == null) { _descriptors.put(descriptor.name, descriptor); _log.info("Registered directive: " + descriptor.name); } else if (descriptor.dirClass != oldDesc.dirClass) { throw new InitException("Attempt to register directive " + directive + " failed because " + oldDesc.dirClass.getName() + " is already registered for type " + descriptor.name); } } }

return "2.0.1";

return "2.0.1.1";

public static String getVersion() { return "2.0.1"; }

in = getClass().getClassLoader().getResourceAsStream(uri);

ClassLoader cl = getBeanDefinitionReader().getBeanClassLoader(); if (cl != null) { in = cl.getResourceAsStream(uri); }

protected InputStream loadResource(String uri) { if (System.getProperty("xbean.dir") != null) { File f = new File(System.getProperty("xbean.dir") + uri); try { return new FileInputStream(f); } catch (FileNotFoundException e) { // Ignore } } // lets try the thread context class loader first InputStream in = Thread.currentThread().getContextClassLoader().getResourceAsStream(uri); if (in == null) { in = getClass().getClassLoader().getResourceAsStream(uri); if (in == null) { logger.debug("Could not find resource: " + uri); } } return in; }

logger.debug("Could not find resource: " + uri);

in = getClass().getClassLoader().getResourceAsStream(uri); if (in == null) { logger.debug("Could not find resource: " + uri); }

protected InputStream loadResource(String uri) { if (System.getProperty("xbean.dir") != null) { File f = new File(System.getProperty("xbean.dir") + uri); try { return new FileInputStream(f); } catch (FileNotFoundException e) { // Ignore } } // lets try the thread context class loader first InputStream in = Thread.currentThread().getContextClassLoader().getResourceAsStream(uri); if (in == null) { in = getClass().getClassLoader().getResourceAsStream(uri); if (in == null) { logger.debug("Could not find resource: " + uri); } } return in; }

AndFilter presenceFilter = new AndFilter(new PacketTypeFilter(Presence.class), new BareAddressFilter(participantJID));

AndFilter presenceFilter = new AndFilter(new PacketTypeFilter(Presence.class), new FromContainsFilter(participantJID));

public ChatRoomImpl(final String participantJID, String participantNickname, String title) { this.participantJID = participantJID; this.participantNickname = participantNickname; AndFilter presenceFilter = new AndFilter(new PacketTypeFilter(Presence.class), new BareAddressFilter(participantJID)); // Register PacketListeners AndFilter messageFilter = new AndFilter(new PacketTypeFilter(Message.class), new BareAddressFilter(participantJID)); SparkManager.getConnection().addPacketListener(this, messageFilter); SparkManager.getConnection().addPacketListener(this, presenceFilter); // The roomname will be the participantJID this.roomname = participantJID; // Use the agents username as the Tab Title this.tabTitle = title; // The name of the room will be the node of the user jid + conversation. final SimpleDateFormat formatter = new SimpleDateFormat("h:mm a"); this.roomTitle = participantNickname; // Add RoomInfo this.getSplitPane().setRightComponent(null); getSplitPane().setDividerSize(0); roster = SparkManager.getConnection().getRoster(); presence = roster.getPresence(participantJID); RosterEntry entry = roster.getEntry(participantJID); tabIcon = SparkManager.getUserManager().getTabIconForPresence(presence); PacketFilter filter = new AndFilter(new PacketTypeFilter(Presence.class), new FromContainsFilter(participantJID)); SparkManager.getConnection().addPacketListener(new PacketListener() { public void processPacket(Packet packet) { presence = (Presence)packet; } }, filter); // Create toolbar buttons. ChatRoomButton infoButton = new ChatRoomButton("", SparkRes.getImageIcon(SparkRes.PROFILE_IMAGE_24x24)); infoButton.setToolTipText(Res.getString("message.view.information.about.this.user")); // Create basic toolbar. getToolBar().addChatRoomButton(infoButton); // If the user is not in the roster, then allow user to add them. if (entry == null && !StringUtils.parseResource(participantJID).equals(participantNickname)) { ChatRoomButton addToRosterButton = new ChatRoomButton("", SparkRes.getImageIcon(SparkRes.ADD_IMAGE_24x24)); addToRosterButton.setToolTipText(Res.getString("message.add.this.user.to.your.roster")); getToolBar().addChatRoomButton(addToRosterButton); addToRosterButton.addActionListener(new ActionListener() { public void actionPerformed(ActionEvent e) { RosterDialog rosterDialog = new RosterDialog(); rosterDialog.setDefaultJID(participantJID); rosterDialog.setDefaultNickname(getParticipantNickname()); rosterDialog.showRosterDialog(SparkManager.getChatManager().getChatContainer().getChatFrame()); } }); } // Show VCard. infoButton.addActionListener(new ActionListener() { public void actionPerformed(ActionEvent e) { VCardManager vcard = SparkManager.getVCardManager(); vcard.viewProfile(participantJID, SparkManager.getChatManager().getChatContainer()); } }); // If this is a private chat from a group chat room, do not show toolbar. if (StringUtils.parseResource(participantJID).equals(participantNickname)) { getToolBar().setVisible(false); } typingTimer = new Timer(2000, new ActionListener() { public void actionPerformed(ActionEvent e) { if(!sendTypingNotification) { return; } long now = System.currentTimeMillis(); if (now - lastTypedCharTime > 2000) { if (!sendNotification) { // send cancel SparkManager.getMessageEventManager().sendCancelledNotification(getParticipantJID(), threadID); sendNotification = true; } } } }); typingTimer.start(); lastActivity = System.currentTimeMillis(); // Add VCard Panel final VCardPanel vcardPanel = new VCardPanel(participantJID); getToolBar().add(vcardPanel, new GridBagConstraints(0, 1, 1, 1, 1.0, 0.0, GridBagConstraints.WEST, GridBagConstraints.HORIZONTAL, new Insets(5, 5, 5, 5), 0, 0)); }

AndFilter messageFilter = new AndFilter(new PacketTypeFilter(Message.class), new BareAddressFilter(participantJID));

AndFilter messageFilter = new AndFilter(new PacketTypeFilter(Message.class), new FromContainsFilter(participantJID));

public ChatRoomImpl(final String participantJID, String participantNickname, String title) { this.participantJID = participantJID; this.participantNickname = participantNickname; AndFilter presenceFilter = new AndFilter(new PacketTypeFilter(Presence.class), new BareAddressFilter(participantJID)); // Register PacketListeners AndFilter messageFilter = new AndFilter(new PacketTypeFilter(Message.class), new BareAddressFilter(participantJID)); SparkManager.getConnection().addPacketListener(this, messageFilter); SparkManager.getConnection().addPacketListener(this, presenceFilter); // The roomname will be the participantJID this.roomname = participantJID; // Use the agents username as the Tab Title this.tabTitle = title; // The name of the room will be the node of the user jid + conversation. final SimpleDateFormat formatter = new SimpleDateFormat("h:mm a"); this.roomTitle = participantNickname; // Add RoomInfo this.getSplitPane().setRightComponent(null); getSplitPane().setDividerSize(0); roster = SparkManager.getConnection().getRoster(); presence = roster.getPresence(participantJID); RosterEntry entry = roster.getEntry(participantJID); tabIcon = SparkManager.getUserManager().getTabIconForPresence(presence); PacketFilter filter = new AndFilter(new PacketTypeFilter(Presence.class), new FromContainsFilter(participantJID)); SparkManager.getConnection().addPacketListener(new PacketListener() { public void processPacket(Packet packet) { presence = (Presence)packet; } }, filter); // Create toolbar buttons. ChatRoomButton infoButton = new ChatRoomButton("", SparkRes.getImageIcon(SparkRes.PROFILE_IMAGE_24x24)); infoButton.setToolTipText(Res.getString("message.view.information.about.this.user")); // Create basic toolbar. getToolBar().addChatRoomButton(infoButton); // If the user is not in the roster, then allow user to add them. if (entry == null && !StringUtils.parseResource(participantJID).equals(participantNickname)) { ChatRoomButton addToRosterButton = new ChatRoomButton("", SparkRes.getImageIcon(SparkRes.ADD_IMAGE_24x24)); addToRosterButton.setToolTipText(Res.getString("message.add.this.user.to.your.roster")); getToolBar().addChatRoomButton(addToRosterButton); addToRosterButton.addActionListener(new ActionListener() { public void actionPerformed(ActionEvent e) { RosterDialog rosterDialog = new RosterDialog(); rosterDialog.setDefaultJID(participantJID); rosterDialog.setDefaultNickname(getParticipantNickname()); rosterDialog.showRosterDialog(SparkManager.getChatManager().getChatContainer().getChatFrame()); } }); } // Show VCard. infoButton.addActionListener(new ActionListener() { public void actionPerformed(ActionEvent e) { VCardManager vcard = SparkManager.getVCardManager(); vcard.viewProfile(participantJID, SparkManager.getChatManager().getChatContainer()); } }); // If this is a private chat from a group chat room, do not show toolbar. if (StringUtils.parseResource(participantJID).equals(participantNickname)) { getToolBar().setVisible(false); } typingTimer = new Timer(2000, new ActionListener() { public void actionPerformed(ActionEvent e) { if(!sendTypingNotification) { return; } long now = System.currentTimeMillis(); if (now - lastTypedCharTime > 2000) { if (!sendNotification) { // send cancel SparkManager.getMessageEventManager().sendCancelledNotification(getParticipantJID(), threadID); sendNotification = true; } } } }); typingTimer.start(); lastActivity = System.currentTimeMillis(); // Add VCard Panel final VCardPanel vcardPanel = new VCardPanel(participantJID); getToolBar().add(vcardPanel, new GridBagConstraints(0, 1, 1, 1, 1.0, 0.0, GridBagConstraints.WEST, GridBagConstraints.HORIZONTAL, new Insets(5, 5, 5, 5), 0, 0)); }

throw new PropertyException("No way to access property " + fillInName(names, start) + " on object " + instance + " of " + instance.getClass() + "--possibly null?");

throw new PropertyException("$" + fillInName(names,start) + " is null. Cannot access ." + names[end]);

public Object getProperty(final Context context, final Object instance, final Object[] names, int start, int end) throws PropertyException { String prop; Object nextProp = null; Accessor acc = null; if (names[start] instanceof String) { prop = (String) names[start]; } else if (names[start] instanceof PropertyMethod) { PropertyMethod pm = (PropertyMethod) names[start]; prop = pm.getName(); acc = (Accessor) _directAccessors.get(prop); Object[] args = pm.getArguments(context); if (acc == null) { if (isMethodRestricted(instance.getClass(), prop)) throw new PropertyException.RestrictedMethodException( pm.toString(), fillInName(names, start), instance.getClass().getName()); throw new PropertyException.NoSuchMethodException( pm.toString(), fillInName(names, start), instance.getClass().getName()); } try { nextProp = acc.get(instance, args); start++; } catch (NoSuchMethodException e) { throw new PropertyException.NoSuchMethodException( pm.toString(), fillInName(names, start), instance.getClass().getName()); } } else { prop = names[start].toString(); } // unary? if (acc == null) { acc = (Accessor) _unaryAccessors.get(prop); if (acc != null) { try { nextProp = acc.get(instance); start++; } catch (NoSuchMethodException e) { acc = null; } } } // binary? if (acc == null) { acc = (Accessor) _binaryAccessors.get(prop); if ((acc != null) && ((start + 1) <= end)) { try { nextProp = acc.get(instance, (String) names[start + 1]); start += 2; } catch (NoSuchMethodException e) { acc = null; } catch (ClassCastException e) { // names[start + 1] was not a String, just move on // this catch is more efficient than using instanceof // since 90% of the time it really will be a string acc = null; } } else { acc = null; } } // hash? if (acc == null) { acc = _hashAccessor; try { if (acc != null) { nextProp = acc.get(instance, prop); start++; } } catch (NoSuchMethodException e) { acc = null; } } if (acc == null) { // user tried to access a property of a property that doesn't exist // ex: $TestObject.FirstName.NotThere // check if object is restricted if (isMethodRestricted(instance.getClass(), "get" + prop) || isMethodRestricted(instance.getClass(), "set" + prop)) throw new PropertyException.RestrictedPropertyException( prop, fillInName(names, start), instance.getClass().getName()); throw new PropertyException.NoSuchPropertyException( prop, fillInName(names, start), instance.getClass().getName()); } if (start <= end) { try { return _cache.getOperator(nextProp) .getProperty(context, nextProp, names, start, end); } catch (NullPointerException e) { // will we ever get here? --eric throw new PropertyException("No way to access property " + fillInName(names, start) + " on object " + instance + " of " + instance.getClass() + "--possibly null?"); } } else { return nextProp; } }

Thread.sleep(500);

Thread.sleep(1000);

private void scrollOnTimer() { SwingWorker worker = new SwingWorker() { public Object construct() { try { Thread.sleep(500); } catch (InterruptedException e) { e.printStackTrace(); } return true; } public void finished() { scrollToBottom(); } }; worker.start(); }

Thread.sleep(500);

Thread.sleep(1000);

public Object construct() { try { Thread.sleep(500); } catch (InterruptedException e) { e.printStackTrace(); } return true; }

for (i = 53; i-- > 0;)

for (i = 58; i-- > 0;)

private final void ReInitRounds(){ int i; jjround = 0x80000001; for (i = 53; i-- > 0;) jjrounds[i] = 0x80000000;}

jjnewStateCnt = 53;

jjnewStateCnt = 58;

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

if (kind > 17) kind = 17;

if (kind > 18) kind = 18;

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

case 54:

case 59:

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2);

jjCheckNAddStates(19, 21); break; case 58: jjCheckNAddStates(19, 21);

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

jjCheckNAddStates(18, 20);

jjCheckNAddStates(22, 24);

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

jjCheckNAddStates(21, 24);

jjCheckNAddStates(25, 28);

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

if (kind > 18) kind = 18;

if (kind > 19) kind = 19;

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

if (kind > 21) kind = 21;

if (kind > 22) kind = 22;

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

if (kind > 21) kind = 21; jjCheckNAddStates(25, 27);

if (kind > 22) kind = 22; jjCheckNAddStates(29, 31);

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

if (curChar == 32 && kind > 28) kind = 28;

if (curChar == 32 && kind > 29) kind = 29;

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

if ((0x100000200L & l) != 0L && kind > 29) kind = 29;

if ((0x100000200L & l) != 0L && kind > 30) kind = 30;

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34;

if ((0xfc00ffffffffffffL & l) != 0L && kind > 36) kind = 36;

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

if (kind > 27) kind = 27; jjCheckNAddStates(10, 14);

if (kind > 28) kind = 28; jjCheckNAddStates(8, 15);

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

jjCheckNAddStates(28, 30);

jjCheckNAddStates(32, 34);

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

if (curChar == 10 && kind > 26) kind = 26;

if (curChar == 10) jjCheckNAddStates(35, 37);

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

jjstateSet[jjnewStateCnt++] = 30;

jjCheckNAdd(30);

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

if (curChar == 13) jjCheckNAddStates(7, 9);

if (curChar == 35) jjCheckNAdd(33);

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

if (curChar == 10) jjCheckNAddTwoStates(29, 31);

if ((0x100000200L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(33);

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break;

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37);

if (curChar == 13) jjstateSet[jjnewStateCnt++] = 35;

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

jjstateSet[jjnewStateCnt++] = 38; break; case 38:

jjstateSet[jjnewStateCnt++] = 43; break; case 43:

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L)

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L)

jjCheckNAddStates(38, 40); break; case 44: if ((0xa7ffec6000000000L & l) == 0L)

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

jjCheckNAddStates(34, 36);

jjCheckNAdd(44); break; case 45: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(45, 46); break; case 46: if (curChar == 40) jjCheckNAdd(47); break; case 47: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(47, 48); break; case 48: if (curChar == 41 && kind > 23) kind = 23;

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50);

if ((0x3ff000000000000L & l) == 0L) break; if (kind > 26) kind = 26; jjCheckNAdd(49);

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

jjCheckNAddStates(37, 39);

jjCheckNAddStates(0, 3); break; case 51: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(51, 52);

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43);

if ((0x3ff000000000000L & l) == 0L) break; if (kind > 24) kind = 24; jjCheckNAddTwoStates(52, 53); break; case 53: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 24) kind = 24; jjCheckNAddStates(41, 43); break; case 54: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(54, 55); break; case 55: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(44, 46); break; case 57: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(47, 50);

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) {

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3;

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

if (kind > 25) kind = 25; jjCheckNAddStates(15, 17);

if (kind > 26) kind = 26; jjCheckNAddStates(16, 18);

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

if (kind > 34) kind = 34;

if (kind > 36) kind = 36;

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

jjCheckNAddStates(3, 6);

jjCheckNAddStates(0, 3);

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

case 53:

case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 59:

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

jjCheckNAddStates(0, 2);

jjCheckNAddStates(19, 21); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 58: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(19, 21);

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

jjCheckNAddStates(0, 2);

jjCheckNAddStates(19, 21);

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break;

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

jjCheckNAddStates(31, 33); break; case 39:

jjCheckNAddStates(29, 31); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 36) kind = 36; break; case 40: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 26) kind = 26; jjCheckNAddStates(16, 18); break; case 41: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(41, 42); break; case 43:

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L)

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L)

jjCheckNAddStates(38, 40); break; case 44: if ((0x47fffffe87ffffffL & l) == 0L)

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

jjCheckNAddStates(34, 36);

jjCheckNAdd(44); break; case 45: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(45, 46); break; case 47: jjAddStates(51, 52);

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

jjCheckNAddTwoStates(49, 50); break; case 50:

jjCheckNAddStates(0, 3); break; case 51: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(51, 52); break; case 52: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 24) kind = 24; jjCheckNAddTwoStates(52, 53); break; case 53: if ((0x7fffffeL & l) == 0L) break; if (kind > 24) kind = 24; jjCheckNAddStates(41, 43); break; case 54: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(54, 55); break; case 55:

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52:

jjCheckNAddStates(44, 46); break; case 56: if (curChar == 96 && kind > 25) kind = 25; break; case 57:

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

jjCheckNAddStates(40, 43);

jjCheckNAddStates(47, 50);

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

case 54:

case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 36) kind = 36; break; case 59:

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53:

jjCheckNAddStates(19, 21); break; case 58:

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

jjCheckNAddStates(21, 24); break; case 42:

jjCheckNAddStates(25, 28); break; case 47:

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

jjAddStates(44, 45);

jjAddStates(51, 52);

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt)))

if ((i = jjnewStateCnt) == (startsAt = 58 - (jjnewStateCnt = startsAt)))

private final int jjMoveNfa_0(int startState, int curPos){ int[] nextStates; int startsAt = 0; jjnewStateCnt = 53; int i = 1; jjstateSet[0] = startState; int j, kind = 0x7fffffff; for (;;) { if (++jjround == 0x7fffffff) ReInitRounds(); if (curChar < 64) { long l = 1L << curChar; MatchLoop: do { switch(jjstateSet[--i]) { case 10: case 9: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 14: case 13: if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 54: case 1: jjCheckNAddStates(0, 2); break; case 7: if ((0xfc00ffffffffffffL & l) != 0L) { if (kind > 34) kind = 34; } else if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); if ((0x3ff600000000000L & l) != 0L) jjCheckNAddTwoStates(13, 14); else if ((0x100000200L & l) != 0L) { if (kind > 29) kind = 29; } else if (curChar == 13) jjCheckNAddStates(7, 9); else if (curChar == 10) { if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); } if ((0x3ff000000000000L & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 53: jjCheckNAddStates(0, 2); break; case 3: jjCheckNAddStates(18, 20); break; case 6: jjCheckNAddStates(21, 24); break; case 11: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 18) kind = 18; jjstateSet[jjnewStateCnt++] = 11; break; case 15: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 16: if (curChar == 46) jjstateSet[jjnewStateCnt++] = 17; break; case 17: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 19: if (curChar == 32) jjstateSet[jjnewStateCnt++] = 20; break; case 20: if (curChar == 32 && kind > 28) kind = 28; break; case 21: if ((0x100000200L & l) != 0L && kind > 29) kind = 29; break; case 22: if ((0xfc00ffffffffffffL & l) != 0L && kind > 34) kind = 34; break; case 23: if (curChar != 10) break; if (kind > 27) kind = 27; jjCheckNAddStates(10, 14); break; case 24: case 25: if (curChar == 10) jjCheckNAddStates(28, 30); break; case 26: if (curChar == 13) jjCheckNAdd(25); break; case 27: if (curChar == 45) jjCheckNAdd(28); break; case 28: if ((0x100000200L & l) == 0L) break; if (kind > 16) kind = 16; jjCheckNAdd(28); break; case 29: case 30: if (curChar == 10 && kind > 26) kind = 26; break; case 31: if (curChar == 13) jjstateSet[jjnewStateCnt++] = 30; break; case 32: if (curChar == 13) jjCheckNAddStates(7, 9); break; case 33: if (curChar == 10) jjCheckNAddTwoStates(29, 31); break; case 34: if (curChar == 10 && kind > 27) kind = 27; break; case 35: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 37: if (curChar == 58) jjstateSet[jjnewStateCnt++] = 38; break; case 38: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0xa7ffec6000000000L & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0xa7ffec6000000000L & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 41: if (curChar == 40) jjCheckNAdd(42); break; case 42: if ((0xfffffdffffffdbffL & l) != 0L) jjCheckNAddTwoStates(42, 43); break; case 43: if (curChar == 41 && kind > 22) kind = 22; break; case 44: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x3ff000000000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 52: if ((0x3ff000000000000L & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else if (curChar < 128) { long l = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 10: if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 17) kind = 17; jjCheckNAdd(9); } else if (curChar == 64) { if (kind > 18) kind = 18; jjCheckNAdd(11); } break; case 14: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 64) jjCheckNAdd(15); break; case 54: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 7: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); else if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; else if (curChar == 91) jjstateSet[jjnewStateCnt++] = 0; if ((0x7fffffe07fffffeL & l) != 0L) { if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); } else if ((0xf8000001f8000001L & l) != 0L) { if (kind > 34) kind = 34; } if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); else if (curChar == 94) jjCheckNAdd(9); break; case 53: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); else if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 0: if (curChar == 91) jjCheckNAddTwoStates(1, 2); break; case 1: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(0, 2); break; case 2: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 3; break; case 3: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(18, 20); break; case 4: if (curChar == 93 && kind > 10) kind = 10; break; case 5: if (curChar == 93) jjstateSet[jjnewStateCnt++] = 4; break; case 6: if ((0xffffffffdfffffffL & l) != 0L) jjCheckNAddStates(21, 24); break; case 8: if (curChar == 94) jjCheckNAdd(9); break; case 9: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 17) kind = 17; jjCheckNAdd(9); break; case 11: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 18) kind = 18; jjCheckNAdd(11); break; case 12: if (curChar == 94) jjstateSet[jjnewStateCnt++] = 10; break; case 13: if ((0x7fffffe87fffffeL & l) != 0L) jjCheckNAddTwoStates(13, 14); break; case 15: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(15, 16); break; case 17: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAdd(18); break; case 18: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 21) kind = 21; jjCheckNAddStates(25, 27); break; case 22: if ((0xf8000001f8000001L & l) != 0L && kind > 34) kind = 34; break; case 35: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAddStates(15, 17); break; case 36: if ((0x7fffffe07fffffeL & l) != 0L) jjCheckNAddTwoStates(36, 37); break; case 38: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAddStates(31, 33); break; case 39: if ((0x47fffffe87ffffffL & l) == 0L) break; if (kind > 22) kind = 22; jjCheckNAdd(39); break; case 40: if ((0x47fffffe87ffffffL & l) != 0L) jjCheckNAddTwoStates(40, 41); break; case 42: jjAddStates(44, 45); break; case 44: if ((0x7fffffe07fffffeL & l) == 0L) break; if (kind > 25) kind = 25; jjCheckNAdd(44); break; case 45: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(3, 6); break; case 46: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(46, 47); break; case 47: if ((0x7fffffe00000000L & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddTwoStates(47, 48); break; case 48: if ((0x7fffffeL & l) == 0L) break; if (kind > 23) kind = 23; jjCheckNAddStates(34, 36); break; case 49: if ((0x7fffffeL & l) != 0L) jjCheckNAddTwoStates(49, 50); break; case 50: if ((0x7fffffe00000000L & l) != 0L) jjCheckNAddStates(37, 39); break; case 51: if (curChar == 96 && kind > 24) kind = 24; break; case 52: if ((0x7fffffeL & l) != 0L) jjCheckNAddStates(40, 43); break; default : break; } } while(i != startsAt); } else { int hiByte = (int)(curChar >> 8); int i1 = hiByte >> 6; long l1 = 1L << (hiByte & 077); int i2 = (curChar & 0xff) >> 6; long l2 = 1L << (curChar & 077); MatchLoop: do { switch(jjstateSet[--i]) { case 54: case 1: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 7: if (jjCanMove_0(hiByte, i1, i2, l1, l2) && kind > 34) kind = 34; break; case 53: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(0, 2); break; case 3: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(18, 20); break; case 6: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjCheckNAddStates(21, 24); break; case 42: if (jjCanMove_0(hiByte, i1, i2, l1, l2)) jjAddStates(44, 45); break; default : break; } } while(i != startsAt); } if (kind != 0x7fffffff) { jjmatchedKind = kind; jjmatchedPos = curPos; kind = 0x7fffffff; } ++curPos; if ((i = jjnewStateCnt) == (startsAt = 53 - (jjnewStateCnt = startsAt))) return curPos; try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { return curPos; } }}

return jjMoveStringLiteralDfa1_0(0x40000000L);

return jjMoveStringLiteralDfa1_0(0x100000000L);

private final int jjMoveStringLiteralDfa0_0(){ switch(curChar) { case 42: jjmatchedKind = 11; return jjMoveStringLiteralDfa1_0(0x40000000L); case 45: return jjMoveStringLiteralDfa1_0(0x100000L); case 60: return jjStopAtPos(0, 14); case 62: return jjStopAtPos(0, 15); case 91: return jjMoveStringLiteralDfa1_0(0x200000000L); case 94: jjmatchedKind = 19; return jjMoveStringLiteralDfa1_0(0x100000000L); case 95: jjmatchedKind = 12; return jjMoveStringLiteralDfa1_0(0x80000000L); case 126: return jjStopAtPos(0, 13); default : return jjMoveNfa_0(7, 0); }}

return jjMoveStringLiteralDfa1_0(0x100000L);

return jjMoveStringLiteralDfa1_0(0x200000L);

private final int jjMoveStringLiteralDfa0_0(){ switch(curChar) { case 42: jjmatchedKind = 11; return jjMoveStringLiteralDfa1_0(0x40000000L); case 45: return jjMoveStringLiteralDfa1_0(0x100000L); case 60: return jjStopAtPos(0, 14); case 62: return jjStopAtPos(0, 15); case 91: return jjMoveStringLiteralDfa1_0(0x200000000L); case 94: jjmatchedKind = 19; return jjMoveStringLiteralDfa1_0(0x100000000L); case 95: jjmatchedKind = 12; return jjMoveStringLiteralDfa1_0(0x80000000L); case 126: return jjStopAtPos(0, 13); default : return jjMoveNfa_0(7, 0); }}

return jjMoveStringLiteralDfa1_0(0x200000000L);

return jjMoveStringLiteralDfa1_0(0x800000000L);

private final int jjMoveStringLiteralDfa0_0(){ switch(curChar) { case 42: jjmatchedKind = 11; return jjMoveStringLiteralDfa1_0(0x40000000L); case 45: return jjMoveStringLiteralDfa1_0(0x100000L); case 60: return jjStopAtPos(0, 14); case 62: return jjStopAtPos(0, 15); case 91: return jjMoveStringLiteralDfa1_0(0x200000000L); case 94: jjmatchedKind = 19; return jjMoveStringLiteralDfa1_0(0x100000000L); case 95: jjmatchedKind = 12; return jjMoveStringLiteralDfa1_0(0x80000000L); case 126: return jjStopAtPos(0, 13); default : return jjMoveNfa_0(7, 0); }}

jjmatchedKind = 19; return jjMoveStringLiteralDfa1_0(0x100000000L);

jjmatchedKind = 20; return jjMoveStringLiteralDfa1_0(0x400000000L);

private final int jjMoveStringLiteralDfa0_0(){ switch(curChar) { case 42: jjmatchedKind = 11; return jjMoveStringLiteralDfa1_0(0x40000000L); case 45: return jjMoveStringLiteralDfa1_0(0x100000L); case 60: return jjStopAtPos(0, 14); case 62: return jjStopAtPos(0, 15); case 91: return jjMoveStringLiteralDfa1_0(0x200000000L); case 94: jjmatchedKind = 19; return jjMoveStringLiteralDfa1_0(0x100000000L); case 95: jjmatchedKind = 12; return jjMoveStringLiteralDfa1_0(0x80000000L); case 126: return jjStopAtPos(0, 13); default : return jjMoveNfa_0(7, 0); }}

case 126: return jjStopAtPos(0, 13);

private final int jjMoveStringLiteralDfa0_0(){ switch(curChar) { case 42: jjmatchedKind = 11; return jjMoveStringLiteralDfa1_0(0x40000000L); case 45: return jjMoveStringLiteralDfa1_0(0x100000L); case 60: return jjStopAtPos(0, 14); case 62: return jjStopAtPos(0, 15); case 91: return jjMoveStringLiteralDfa1_0(0x200000000L); case 94: jjmatchedKind = 19; return jjMoveStringLiteralDfa1_0(0x100000000L); case 95: jjmatchedKind = 12; return jjMoveStringLiteralDfa1_0(0x80000000L); case 126: return jjStopAtPos(0, 13); default : return jjMoveNfa_0(7, 0); }}

if ((active0 & 0x40000000L) != 0L) return jjStopAtPos(1, 30); break; case 45: return jjMoveStringLiteralDfa2_0(active0, 0x100000L); case 91: return jjMoveStringLiteralDfa2_0(active0, 0x200000000L); case 94:

private final int jjMoveStringLiteralDfa1_0(long active0){ try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(0, active0); return 1; } switch(curChar) { case 42: if ((active0 & 0x40000000L) != 0L) return jjStopAtPos(1, 30); break; case 45: return jjMoveStringLiteralDfa2_0(active0, 0x100000L); case 91: return jjMoveStringLiteralDfa2_0(active0, 0x200000000L); case 94: if ((active0 & 0x100000000L) != 0L) return jjStopAtPos(1, 32); break; case 95: if ((active0 & 0x80000000L) != 0L) return jjStartNfaWithStates_0(1, 31, 14); break; default : break; } return jjStartNfa_0(0, active0);}

return jjStartNfaWithStates_0(1, 31, 14);

return jjStopAtPos(1, 31);

private final int jjMoveStringLiteralDfa1_0(long active0){ try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(0, active0); return 1; } switch(curChar) { case 42: if ((active0 & 0x40000000L) != 0L) return jjStopAtPos(1, 30); break; case 45: return jjMoveStringLiteralDfa2_0(active0, 0x100000L); case 91: return jjMoveStringLiteralDfa2_0(active0, 0x200000000L); case 94: if ((active0 & 0x100000000L) != 0L) return jjStopAtPos(1, 32); break; case 95: if ((active0 & 0x80000000L) != 0L) return jjStartNfaWithStates_0(1, 31, 14); break; default : break; } return jjStartNfa_0(0, active0);}

return jjMoveStringLiteralDfa3_0(active0, 0x100000L);

return jjMoveStringLiteralDfa3_0(active0, 0x200000L);

private final int jjMoveStringLiteralDfa2_0(long old0, long active0){ if (((active0 &= old0)) == 0L) return jjStartNfa_0(0, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(1, active0); return 2; } switch(curChar) { case 45: return jjMoveStringLiteralDfa3_0(active0, 0x100000L); case 91: return jjMoveStringLiteralDfa3_0(active0, 0x200000000L); default : break; } return jjStartNfa_0(1, active0);}

return jjMoveStringLiteralDfa3_0(active0, 0x200000000L);

return jjMoveStringLiteralDfa3_0(active0, 0x800000000L);

private final int jjMoveStringLiteralDfa2_0(long old0, long active0){ if (((active0 &= old0)) == 0L) return jjStartNfa_0(0, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(1, active0); return 2; } switch(curChar) { case 45: return jjMoveStringLiteralDfa3_0(active0, 0x100000L); case 91: return jjMoveStringLiteralDfa3_0(active0, 0x200000000L); default : break; } return jjStartNfa_0(1, active0);}

return jjMoveStringLiteralDfa4_0(active0, 0x100000L);

return jjMoveStringLiteralDfa4_0(active0, 0x200000L);

private final int jjMoveStringLiteralDfa3_0(long old0, long active0){ if (((active0 &= old0)) == 0L) return jjStartNfa_0(1, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(2, active0); return 3; } switch(curChar) { case 45: return jjMoveStringLiteralDfa4_0(active0, 0x100000L); case 91: if ((active0 & 0x200000000L) != 0L) return jjStartNfaWithStates_0(3, 33, 54); break; default : break; } return jjStartNfa_0(2, active0);}

if ((active0 & 0x200000000L) != 0L) return jjStartNfaWithStates_0(3, 33, 54);

if ((active0 & 0x800000000L) != 0L) return jjStartNfaWithStates_0(3, 35, 59);

private final int jjMoveStringLiteralDfa3_0(long old0, long active0){ if (((active0 &= old0)) == 0L) return jjStartNfa_0(1, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(2, active0); return 3; } switch(curChar) { case 45: return jjMoveStringLiteralDfa4_0(active0, 0x100000L); case 91: if ((active0 & 0x200000000L) != 0L) return jjStartNfaWithStates_0(3, 33, 54); break; default : break; } return jjStartNfa_0(2, active0);}

if ((active0 & 0x100000L) != 0L) return jjStartNfaWithStates_0(4, 20, 14);

if ((active0 & 0x200000L) != 0L) return jjStartNfaWithStates_0(4, 21, 14);

private final int jjMoveStringLiteralDfa4_0(long old0, long active0){ if (((active0 &= old0)) == 0L) return jjStartNfa_0(2, old0); try { curChar = input_stream.readChar(); } catch(java.io.IOException e) { jjStopStringLiteralDfa_0(3, active0); return 4; } switch(curChar) { case 45: if ((active0 & 0x100000L) != 0L) return jjStartNfaWithStates_0(4, 20, 14); break; default : break; } return jjStartNfa_0(3, active0);}

if ((active0 & 0x200000000L) != 0L)

if ((active0 & 0x800000000L) != 0L)

private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}

jjmatchedKind = 34;

jjmatchedKind = 36;

private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}

if ((active0 & 0x100000L) != 0L)

if ((active0 & 0x400100000L) != 0L) return 10; if ((active0 & 0x200000L) != 0L)

private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}

if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L)

if ((active0 & 0x200001000L) != 0L)

private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}

if ((active0 & 0x100000L) != 0L)

if ((active0 & 0x800000000L) != 0L)

private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}

jjmatchedKind = 34;

jjmatchedKind = 36; jjmatchedPos = 0; } return 58; } if ((active0 & 0x200000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 36;

private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}

return 53;

return 59;

private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}

if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L)

if ((active0 & 0x200000L) != 0L)

private final int jjStopStringLiteralDfa_0(int pos, long active0){ switch (pos) { case 0: if ((active0 & 0x200000000L) != 0L) { jjmatchedKind = 34; return 0; } if ((active0 & 0x100000L) != 0L) { jjmatchedKind = 34; return 14; } if ((active0 & 0x100080000L) != 0L) return 10; if ((active0 & 0x80001000L) != 0L) return 14; return -1; case 1: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 53; } if ((active0 & 0x80000000L) != 0L) return 14; return -1; case 2: if ((active0 & 0x200000000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 54; } if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } return -1; case 3: if ((active0 & 0x100000L) != 0L) { if (jjmatchedPos == 0) { jjmatchedKind = 34; jjmatchedPos = 0; } return 14; } if ((active0 & 0x200000000L) != 0L) return 54; return -1; default : return -1; }}