anchor.diff:    
     Differences to other regular expression parsers
     ------------------------------------------------
  -   * Sequences of bytes or other fundamental objects (atoms)
  +   * Bytes: the language operates over byte sequences rather than text sequences.
  +
  +   * Trees: 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.
  +
  +   * Lists: In any case, the tree mode is turned off by default.
  +     Instead of the deeply nested tree structures produced by traditional parsing,
  +     sequences are represented directly as sequences, with an ordered list of children.
  +
  +     "sequencesAsTree" defines whether to output sequences as nested trees or lists.
        
     To do
     -----
  
positive.code: 
  @lexer::members { 
  	boolean inRepeat=false;
  	//boolean inSet=false;
  	int inSet = 0;
  }
  
  
  start	:	regex EOF!				
  
negative.code:          INVERTED_SET;
           RANGE;
           BITMASK; 
           ANY; 
  }
  
  