moved the original colm src dir to /colm

1 files changed, 0 insertions, 117 deletions

diff --git a/src/dotgen.cc b/src/dotgen.cc
deleted file mode 100644
index 42f54159..00000000
--- a/src/dotgen.cc
+++ /dev/null
@@ -1,117 +0,0 @@
-/*
- * Copyright 2006-2018 Adrian Thurston <thurston@colm.net>
- *
- * Permission is hereby granted, free of charge, to any person obtaining a copy
- * of this software and associated documentation files (the "Software"), to
- * deal in the Software without restriction, including without limitation the
- * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
- * sell copies of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included in all
- * copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-
-#include <stdbool.h>
-
-#include <iostream>
-
-#include "compiler.h"
-
-using namespace std;
-
-void Compiler::writeTransList( PdaState *state )
-{
-	ostream &out = *outStream;
-	for ( TransMap::Iter trans = state->transMap; trans.lte(); trans++ ) {
-		/* Write out the from and to states. */
-		out << "\t" << state->stateNum << " -> " << trans->value->toState->stateNum;
-
-		/* Begin the label. */
-		out << " [ label = \""; 
-		long key = trans->key;  
-		LangEl *lel = langElIndex[key];
-		if ( lel != 0 )
-			out << lel->name;
-		else
-			out << (char)key;
-
-		if ( trans->value->actions.length() > 0 ) {
-			out << " / ";
-			for ( ActDataList::Iter act = trans->value->actions; act.lte(); act++ ) {
-				switch ( *act & 0x3 ) {
-				case 1: 
-					out << "S(" << trans->value->actOrds[act.pos()] << ")";
-					break;
-				case 2: {
-					out << "R(" << prodIdIndex[(*act >> 2)]->data <<
-							", " << trans->value->actOrds[act.pos()] << ")";
-					break;
-				}
-				case 3: {
-					out << "SR(" << prodIdIndex[(*act >> 2)]->data << 
-							", " << trans->value->actOrds[act.pos()] << ")";
-					break;
-				}}
-				if ( ! act.last() )
-					out << ", ";
-			}
-		}
-
-		out << "\" ];\n";
-	}
-}
-
-void Compiler::writeDotFile( PdaGraph *graph )
-{
-	ostream &out = *outStream;
-	out << 
-		"digraph " << parserName << " {\n"
-		"	rankdir=LR;\n"
-		"	ranksep=\"0\"\n"
-		"	nodesep=\"0.25\"\n"
-		"\n";
-	
-	/* Define the psuedo states. Transitions will be done after the states
-	 * have been defined as either final or not final. */
-	out << 
-		"	node [ shape = point ];\n";
-	
-	for ( int i = 0; i < graph->entryStateSet.length(); i++ )
-		out << "\tENTRY" << i <<  " [ label = \"\" ];\n";
-
-	out << 
-		"\n"
-		"	node [ shape = circle, fixedsize = true, height = 0.6 ];\n";
-
-	/* Walk the states. */
-	for ( PdaStateList::Iter st = graph->stateList; st.lte(); st++ )
-		out << "	" << st->stateNum << " [ label = \"" << st->stateNum << "\" ];\n";
-
-	out << "\n";
-
-	/* Walk the states. */
-	for ( PdaStateList::Iter st = graph->stateList; st.lte(); st++ )
-		writeTransList( st );
-
-	/* Start state and other entry points. */
-	for ( PdaStateSet::Iter st = graph->entryStateSet; st.lte(); st++ )
-		out << "\tENTRY" << st.pos() << " -> " << (*st)->stateNum << " [ label = \"\" ];\n";
-
-	out <<
-		"}\n";
-}
-
-void Compiler::writeDotFile()
-{
-	writeDotFile( pdaGraph );
-}
-