anchor.diff:           INVERTED_SET;
            RANGE;
            BITMASK; 
  -         //CASE_SENSITIVE;
  -         //CASE_INSENSITIVE;
            ANY; 
   }
   
  
positive.code:   
    Differences to other regular expression parsers
    ------------------------------------------------
     * Sequences of bytes or other fundamental objects (atoms)
       produce right-associative trees, rather than the more normal left-
       associative form.  This doesn't make any material difference.
       
    To do
    -----
  
negative.code: 
  @lexer::members { 
  	boolean inRepeat=false;
  	int inSet = 0;
          boolean throwExceptionOnError = true;
  
          @Override
          public void reportError(RecognitionException e) {
              if (throwExceptionOnError) {
                  throw new IllegalArgumentException(e);
              } else {
                  super.reportError(e);
              }
          }
  }
  
  
  
  start	:	regex EOF!				
  