testregexpparser.java

Grammatica is a C# and Java parser generator (compiler compiler). It improves upon simlar tools (lik

/*
 * TestRegexpParser.java
 *
 * This work 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 work 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
 *
 * As a special exception, the copyright holders of this library give
 * you permission to link this library with independent modules to
 * produce an executable, regardless of the license terms of these
 * independent modules, and to copy and distribute the resulting
 * executable under terms of your choice, provided that you also meet,
 * for each linked independent module, the terms and conditions of the
 * license of that module. An independent module is a module which is
 * not derived from or based on this library. If you modify this
 * library, you may extend this exception to your version of the
 * library, but you are not obligated to do so. If you do not wish to
 * do so, delete this exception statement from your version.
 *
 * Copyright (c) 2003 Per Cederberg. All rights reserved.
 */

package net.percederberg.grammatica.test;

import java.io.StringReader;

import net.percederberg.grammatica.parser.ParseException;
import net.percederberg.grammatica.parser.Parser;
import net.percederberg.grammatica.parser.ParserCreationException;

/**
 * A test case for the generated RegexpParser class.
 *
 * @author   Per Cederberg, <per at percederberg dot net>
 * @version  1.0
 */
public class TestRegexpParser extends ParserTestCase {

    /**
     * The valid input string.
     */
    private static final String VALID_INPUT =
        "[a-z.]+(a|b).?";
        
    /**
     * The parse tree for the valid input string.
     */
    private static final String VALID_OUTPUT =
        "Expr(2001)\n" +
        "  Term(2002)\n" +
        "    Fact(2003)\n" +
        "      Atom(2004)\n" +
        "        LEFT_BRACKET(1003): \"[\", line: 1, col: 1\n" +
        "        CharacterSet(2006)\n" +
        "          Character(2007)\n" +
        "            CHAR(1014): \"a\", line: 1, col: 2\n" +
        "          Character(2007)\n" +
        "            CHAR(1014): \"-\", line: 1, col: 3\n" +
        "          Character(2007)\n" +
        "            CHAR(1014): \"z\", line: 1, col: 4\n" +
        "          Character(2007)\n" +
        "            DOT(1011): \".\", line: 1, col: 5\n" +
        "        RIGHT_BRACKET(1004): \"]\", line: 1, col: 6\n" +
        "      AtomModifier(2005)\n" +
        "        PLUS(1009): \"+\", line: 1, col: 7\n" +
        "    Fact(2003)\n" +
        "      Atom(2004)\n" +
        "        LEFT_PAREN(1001): \"(\", line: 1, col: 8\n" +
        "        Expr(2001)\n" +
        "          Term(2002)\n" +
        "            Fact(2003)\n" +
        "              Atom(2004)\n" +
        "                CHAR(1014): \"a\", line: 1, col: 9\n" +
        "          VERTICAL_BAR(1010): \"|\", line: 1, col: 10\n" +
        "          Expr(2001)\n" +
        "            Term(2002)\n" +
        "              Fact(2003)\n" +
        "                Atom(2004)\n" +
        "                  CHAR(1014): \"b\", line: 1, col: 11\n" +
        "        RIGHT_PAREN(1002): \")\", line: 1, col: 12\n" +
        "    Fact(2003)\n" +
        "      Atom(2004)\n" +
        "        DOT(1011): \".\", line: 1, col: 13\n" +
        "      AtomModifier(2005)\n" +
        "        QUESTION(1007): \"?\", line: 1, col: 14\n";
        
    /**
     * The unexpected EOF input string.
     */
    private static final String UNEXPECTED_EOF_INPUT = "(abc";

    /**
     * The unexpected character input string.
     */
    private static final String UNEXPECTED_CHAR_INPUT = "a\nb";

    /**
     * The unexpected token input string.
     */
    private static final String UNEXPECTED_TOKEN_INPUT = "abc)";

    /**
     * Creates a new test case.
     * 
     * @param name           the test case name
     */
    public TestRegexpParser(String name) {
        super(name);
    }
     
    /**
     * Tests parsing a valid input string.
     */
    public void testValidInput() {
        parse(createParser(VALID_INPUT), VALID_OUTPUT);
    }

    /**
     * Tests parsing with an unexpected EOF error.
     */
    public void testUnexpectedEOF() {
        failParse(createParser(UNEXPECTED_EOF_INPUT),
                  ParseException.UNEXPECTED_EOF_ERROR,
                  1,
                  5);
    }
    
    /**
     * Tests parsing with an unexpected character error.
     */
    public void testUnexpectedChar() {
        failParse(createParser(UNEXPECTED_CHAR_INPUT),
                  ParseException.UNEXPECTED_CHAR_ERROR,
                  1,
                  2);
    }
    
    /**
     * Tests parsing with an unexpected token error.
     */
    public void testUnexpectedToken() {
        failParse(createParser(UNEXPECTED_TOKEN_INPUT),
                  ParseException.UNEXPECTED_TOKEN_ERROR,
                  1,
                  4);
    }
    
    /**
     * Creates a new parser.
     * 
     * @param input          the input to parse
     * 
     * @return the parser created 
     */
    private Parser createParser(String input) {
        Parser  parser = null;

        try {
            parser = new RegexpParser(new StringReader(input));
            parser.prepare();
        } catch (ParserCreationException e) {
            fail(e.getMessage());
        }
        return parser;
    }
}