org.efaps.beans.valueparser.ValueParser Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of efaps-kernel Show documentation

eFaps is a framework used to map objects with or without attached files to a relational database and optional file systems (only for attaches files). Configurable access control can be provided down to object and attribute level depending on implementation and use case. Depending on requirements, events (like triggers) allow to implement business logic and to separate business logic from user interface. The framework includes integrations (e.g. webdav, full text search) and a web application as 'simple' configurable user interface. Some best practises, example web application modules (e.g. team work module) support administrators and implementers using this framework.

There is a newer version: 3.2.0

Show newest version

/* Generated By:JavaCC: Do not edit this line. ValueParser.java */
package org.efaps.beans.valueparser;

import java.util.HashSet;

import org.efaps.beans.ValueList;

public class ValueParser implements ValueParserConstants {

private final static String[] tests = new String[]{
    "$",
    "Text$",
    "Text$Expr",
    "Text$$",
    "Dies ist ein Test fuer $ und $",
    "Dies ist ein Test fuer $ und $\u005cnin zwei Zeilen mit $ in 2. Zeile."
};

private final static String[][] expressions = new String[][]{
    {"Expr"},
    {"Expr"},
    {},
    {"Expr"},
    {"Expr1", "Expr2"},
    {"Expr1", "Expr2", "Expr3"}
};


  public static void main(String args[]) throws ParseException {
    for (int i=0; i jj_expentries = new java.util.ArrayList();
  private int[] jj_expentry;
  private int jj_kind = -1;

  /** Generate ParseException. */
  public ParseException generateParseException() {
    jj_expentries.clear();
    boolean[] la1tokens = new boolean[11];
    if (jj_kind >= 0) {
      la1tokens[jj_kind] = true;
      jj_kind = -1;
    }
    for (int i = 0; i < 2; i++) {
      if (jj_la1[i] == jj_gen) {
        for (int j = 0; j < 32; j++) {
          if ((jj_la1_0[i] & (1<