As the people from University of Luebeck (now moved to the University
of Goettingen) don't have the time to maintain the TTCN3Parser, I
decided to rewrite it to fix some critical problems.  I did not use
C++ and ANTLR, but Python and the PyParsing module for this.  The new
version is in it's very early stages and has some major issues:

- speed: the performance is unbelievably bad

- error handling: in most cases, the error message points to a higher
  level construct instead of the real problem

- no output: I did not yet implement a tree output function, '-t'
  gives a pseudo-XML output of the parse tree

On the other hand, the new version follows the latest TTCN-3 standard.

W. Borgert, 2005-01-22

Old version README by the original crew:

/*
 *           TTCN-3 Parser
 *
 *       Request for comments
 *
 * Copyright (C) 2002 Institute for Telematics
 *
 *    Michael Schmitt
 *    Roman Koch
 *    Helmut Neukirchen <neukirchen@itm.uni-luebeck.de>
 *    Jens Grabowski <grabowsk@itm.uni-luebeck.de>
 *
 *    University of Luebeck,
 *    Ratzeburger Allee 160,
 *    23538 Luebeck,
 *    Germany
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 * $Id: README,v 1.5 2002/12/18 16:21:26 neukirchen Exp $
 *
 */

Dear TTCN-3 developer,

great care has been taken to create a parser that reflects the TTCN-3 
standard correctly and that produces abstract syntax trees (ASTs) which
can be evaluated easily.

But no software program is error-free! Hence,

          WE NEED YOUR ASSISTANCE

to make this parser as good as possible. If you run the TTCN-3 parser, 
we would like you to check the following issues:

  - Does the TTCN-3 parser reject a correct TTCN-3 module?
  - Does the tree parser (i.e. the AST analyzer) reject some AST?
  - Does the TTCN-3 parser produce incorrect ASTs,
    e.g. does it take a 'GetReplyStatement' for a 'ReceiveStatement'?
  - Are line and column information erroneous?
  - Do the ASTs contain superfluous nodes, i.e. nodes that blow up
    the tree unnecessarily?
  - Do the ASTs lack some nodes that you would like to see?
  - Or would you like to have some nodes arranged in a different way?

If you feel like the parser behaves inadequately, please send a short email
to 'neukirchen@itm.uni-luebeck.de'. If possible, please also send us a TTCN-3
example that illustrates the deficiency.

Well, that's all we are asking for...

   IT'S NOT TOO MUCH FOR A FREE TTCN-3 PARSER, IS IT?

Thanks in advance!

Michael Schmitt, Roman Koch, Jens Grabowski, Helmut Neukirchen
