An Object-oriented Approach to Finite State Automata

using System;
using System.Collections.Generic;
using System.Text.RegularExpressions;

namespace FSA
{
	public class ParsingAutomaton : FiniteStateAutomaton
	{
		private ParsingState[] states;

		public ParsingAutomaton(ParsingState[] states)
		{
			this.states = states;
		}
		public override void Reset()
		{
			CurrentState = 0;
		}
		public override int Send(int input)
		{
			return Send(input.ToString());
		}
		public int Send(string token)
		{
			ParsingState currentState = states[CurrentState];
			foreach (var pair in currentState.Expressions) {
				if (Regex.IsMatch(token, pair.Key)) {
					CurrentState = pair.Value;
					return states[CurrentState].Output;
				}
			}

			CurrentState = currentState.EmptyTransition;
			return states[CurrentState].Output;			
		}
		public int Send(char token)
		{
			foreach (var pair in states[CurrentState].SpecificCharacters) {
				if (token.Equals(pair.Key)) {
					CurrentState = pair.Value;
					return states[CurrentState].Output;
				}
			}
			return Send(token.ToString());
		}
		public override FiniteStateAutomaton ShallowCopy()
		{
			ParsingAutomaton copy = new ParsingAutomaton(states);
			return copy;
		}
	}
	public enum ParseCases
	{
		
	}
}