/*
    * Zemucan: A Syntax Assistant for DB2
    * Copyright (C) 2009, 2010 Andres Gomez Casanova
    *
    * This file is part of Zemucan.
    *
    * Zemucan is free software: you can redistribute it and/or modify
    * it under the terms of the GNU Lesser General Public License as published by
    * the Free Software Foundation; either version 3 of the License, or
   * (at your option) any later version.
   *
   * Zemucan 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 Lesser General Public License for more details.
   *
   * You should have received a copy of the GNU Lesser General Public License
   * along with this library; if not, see <http://www.gnu.org/licenses/>.
   *
   * Contact:
   * a n g o c a  at  y a h o o  dot  c o m
   * Cra. 45 No 61 - 31, Bogota, Colombia.
   *
   * Author:   $LastChangedBy: angoca $:
   * Date:     $LastChangedDate: 2011-03-06 10:15:32 -0500 (dom, 06 mar 2011) $:
   * Revision: $LastChangedRevision: 1913 $:
   * URL:      $HeadURL: https://zemucan.svn.sourceforge.net/svnroot/zemucan/branches/zemucan_v1/source-code/grammarReaderApi/src/test/java/name/angoca/zemucan/grammarReader/api/ImplementationInMemoryGrammarReader.java $:
   */
  package name.angoca.zemucan.grammarReader.api;
  
  import name.angoca.zemucan.AbstractZemucanException;
  import name.angoca.zemucan.core.graph.model.Graph;
  import name.angoca.zemucan.tools.Constants;
  
  /**
   * This class permits to load grammars in memory without using a file. The
   * complete definition of the grammar is here. It's just for tests.
   * <p>
   * <b>Control Version</b>
   * <p>
   * <ul>
   * <li>1.0.0 Class creation.</li>
   * <li>1.9.0 Return graph.</li>
   * <li>1.10.0 Protected attributes -> private.</li>
   * </ul>
   *
   * @author Andres Gomez Casanova <a
   *         href="mailto:a n g o c a at y a h o o dot c o m">(AngocA)</a>
   * @version 1.10.0 2010-06-18
   */
  public final class ImplementationInMemoryGrammarReader extends
          AbstractGrammarReader {
  
      /**
       * Grammar delimiters.
       */
      private static final String DELIMITERS = " ,()";
  
      /**
       * Graph.
       */
      private final Graph graph;
  
      /**
       * Default constructor.
       *
       * @param graphToFill
       *            Graph where the grammar will be
       * @param grammarName
       *            Nothing
       * @throws Exception
       *             If there is a problem.
       */
      public ImplementationInMemoryGrammarReader(final Graph/* ! */graphToFill,
              final String/* ! */grammarName) throws Exception {
          super();
  
          assert graphToFill != null;
          assert grammarName != null;
  
          this.graph = graphToFill;
  
          if (grammarName.equals("sa_conf-test-grammar1.xml")) { //$NON-NLS-1$
              // Delimiters
              super.setDelimiters(ImplementationInMemoryGrammarReader.DELIMITERS);
  
              this.testGraph1(graphToFill);
  
              super.setStartingNode(graphToFill.getStartingNode());
          } else if (grammarName.equals("sa_conf-test-grammar2.xml")) { //$NON-NLS-1$
              // Delimiters
              super.setDelimiters(ImplementationInMemoryGrammarReader.DELIMITERS);
  
              this.testGraph2(graphToFill);
  
              super.setStartingNode(graphToFill.getStartingNode());
          } else if (grammarName.equals("sa_conf-test-grammarIdentical1.xml") //$NON-NLS-1$
                  || grammarName.equals("sa_conf-test-grammarIdentical2.xml")) { //$NON-NLS-1$
              // Delimiters
             super.setDelimiters(ImplementationInMemoryGrammarReader.DELIMITERS);
 
             this.testGraph3(graphToFill);
 
             super.setStartingNode(graphToFill.getStartingNode());
         } else {
             throw new Exception("Grammar not identified"); //$NON-NLS-1$
         }
     }
 
     @Override
     public Graph/* ! */generateGraph() throws AbstractZemucanException {
         super.setGrammarProcessed(true);
 
         assert this.graph != null;
 
         return this.graph;
     }
 
     private void testGraph1(final Graph/* ! */graphToFill)
             throws AbstractZemucanException {
         assert graphToFill != null;
 
         // Graph
         final String create = "create"; //$NON-NLS-1$
         final String table = "table"; //$NON-NLS-1$
 
         graphToFill.addNode(Constants.STARTING_NODE, Constants.STARTING_NODE,
                 true);
         graphToFill.addNode(create, create, true);
         graphToFill.addNode(table, table, true);
         graphToFill.addNode(Constants.ENDING_NODE, Constants.ENDING_NODE, true);
         graphToFill.firstPhaseFinished();
         graphToFill.addRelation(Constants.STARTING_NODE, create);
         graphToFill.addRelation(create, table);
         graphToFill.addRelation(table, Constants.ENDING_NODE);
         graphToFill.secondPhaseFinished();
     }
 
     private void testGraph2(final Graph/* ! */graphToFill)
             throws AbstractZemucanException {
         assert graphToFill != null;
 
         // Graph
         final String create = "create"; //$NON-NLS-1$
         final String tablespace = "tablespace"; //$NON-NLS-1$
 
         graphToFill.addNode(Constants.STARTING_NODE, Constants.STARTING_NODE,
                 true);
         graphToFill.addNode(create, create, true);
         graphToFill.addNode(tablespace, tablespace, true);
         graphToFill.addNode(Constants.ENDING_NODE, Constants.ENDING_NODE, true);
         graphToFill.firstPhaseFinished();
         graphToFill.addRelation(Constants.STARTING_NODE, create);
         graphToFill.addRelation(create, tablespace);
         graphToFill.addRelation(tablespace, Constants.ENDING_NODE);
         graphToFill.secondPhaseFinished();
     }
 
     private void testGraph3(final Graph/* ! */graphToFill)
             throws AbstractZemucanException {
         assert graphToFill != null;
 
         // Graph
         final String create = "create"; //$NON-NLS-1$
 
         graphToFill.addNode(Constants.STARTING_NODE, Constants.STARTING_NODE,
                 true);
         graphToFill.addNode(create, create, true);
         graphToFill.addNode(Constants.ENDING_NODE, Constants.ENDING_NODE, true);
         graphToFill.firstPhaseFinished();
         graphToFill.addRelation(Constants.STARTING_NODE, create);
         graphToFill.addRelation(create, Constants.ENDING_NODE);
         graphToFill.secondPhaseFinished();
     }
 }