August 6 2014: Starting the Parser State Machine
	New Files:
		bnfLexer:
			This will contain the lexical structure of bnf,
			which will allow the program to read bnf files
			as parsing grammars.
		statemachine:
			This is the underlying structure of the parser.
			It can create finite/infinite statemachines, and
			really is just a directed graph. The
			statemachine will run on a depth-first-search
			type algorithm to determine if the states match
			a valid path to a null (None) termination point.
	Modified Files:
		css_muncher:
			Removed the vcssLexer file so I also removed the
			import statement. Currently after lexing, if the
			minify flag is set, the program will remove all
			comment and newline tokens from the list of
			tokens. Then it prints all the tokens and the
			number of tokens. With the single.vcss file,
			without minify set, there are 100 tokens, and
			with minify set, there are 69 tokens. If we were
			able to simply remove all whitespaces, it is
			brought down to 49 tokens, but spaces are
			sometimes necessary.
		cssLexer:
			Added vcss to the accepted file formats.
		parser:
			Started defining parts for the parser and what
			kind of language it will read and understand.
			This isn't fully defined yet and is subject to
			change dramatically.
	Deleted Files:
		lexer_regex:
			This was removed since it isn't necessary at all,
			it was mostly just scratch work.
		vcssLexer:
			This was removed since the cssLexer is capable
			of lexing vcss and css files.

The future of the program:
	First: Finish the statemachine and get that working.
	Next: Get the program to properly lex bnf files.
	Then Using the bnf grammar, build a statemachine that represents
	the grammar.

	This should be enough to keep me busy.