implab/ImplabNet Files · Implab/Automaton/RegularExpressions/RegularDFADefinition.cs

Almost complete DFA refactoring

cin - - Load All Authors

File last commit:

r164:ec35731ae299 ref20160224


                r164:ec35731ae299

ref20160224

Download file

             RegularDFADefinition.cs
        
                    46 lines
            
             | 1.5 KiB
            
                | text/x-csharp
            
             |
                CSharpLexer
            
             / Implab / Automaton / RegularExpressions / RegularDFADefinition.cs
          
                    History
                
                 |
                  Annotation
                 | Raw
                 |Copy content
                 |Copy permalink

      using System;

      namespace Implab.Automaton.RegularExpressions {

          public class RegularDFADefinition<TInput, TTag> : DFATransitionTable<TTag>, IDFATransitionTable<TTag> {

              readonly IAlphabet<TInput> m_alphabet;

              readonly int m_initialState;

              public RegularDFADefinition(IAlphabet<TInput> alphabet, int initialState) {

                  Safe.ArgumentNotNull(alphabet, "aplhabet");

                  m_alphabet = alphabet;

                  m_initialState = initialState;

              }

              public IAlphabet<TInput> InputAlphabet {

                  get {

                      return m_alphabet;

                  }

              }

              protected override DFAStateDescriptior<TTag>[] ConstructTransitionTable() {

                  if (InputAlphabet.Count != m_alphabet.Count)

                      throw new InvalidOperationException("The alphabet doesn't match the transition table");

                  return base.ConstructTransitionTable();

              }

              /// <summary>

              /// Optimize the specified alphabet.

              /// </summary>

              /// <param name="alphabet">Пустой алфавит, который будет зполнен в процессе оптимизации.</param>

              public  RegularDFADefinition<TInput, TTag> Optimize(IAlphabetBuilder<TInput> alphabet) {

                  Safe.ArgumentNotNull(alphabet, "alphabet");

                  var optimalDFA = new RegularDFADefinition<TInput,TTag>(alphabet, m_initialState);

                  Optimize(optimalDFA, InputAlphabet, alphabet, new DummyAlphabet(StateCount), new MapAlphabet<int>()); 

              }

          }

      }

	Site-wide shortcuts
/	Use quick search box
g h	Goto home page
g g	Goto my private gists page
g G	Goto my public gists page
g 0-9	Goto bookmarked items from 0-9
n r	New repository page
n g	New gist page

	Repositories
g s	Goto summary page
g c	Goto changelog page
g f	Goto files page
g F	Goto files page with file search activated
g p	Goto pull requests page
g o	Goto repository settings
g O	Goto repository access permissions settings
t s	Toggle sidebar on some pages

				using System;

				namespace Implab.Automaton.RegularExpressions {
				public class RegularDFADefinition<TInput, TTag> : DFATransitionTable<TTag>, IDFATransitionTable<TTag> {

				readonly IAlphabet<TInput> m_alphabet;
				readonly int m_initialState;

				public RegularDFADefinition(IAlphabet<TInput> alphabet, int initialState) {
				Safe.ArgumentNotNull(alphabet, "aplhabet");

				m_alphabet = alphabet;
				m_initialState = initialState;
				}


				public IAlphabet<TInput> InputAlphabet {
				get {
				return m_alphabet;
				}
				}

				protected override DFAStateDescriptior<TTag>[] ConstructTransitionTable() {
				if (InputAlphabet.Count != m_alphabet.Count)
				throw new InvalidOperationException("The alphabet doesn't match the transition table");

				return base.ConstructTransitionTable();
				}

				/// <summary>
				/// Optimize the specified alphabet.
				/// </summary>
				/// <param name="alphabet">Пустой алфавит, который будет зполнен в процессе оптимизации.</param>
				public RegularDFADefinition<TInput, TTag> Optimize(IAlphabetBuilder<TInput> alphabet) {
				Safe.ArgumentNotNull(alphabet, "alphabet");

				var optimalDFA = new RegularDFADefinition<TInput,TTag>(alphabet, m_initialState);

				Optimize(optimalDFA, InputAlphabet, alphabet, new DummyAlphabet(StateCount), new MapAlphabet<int>());

				}


				}
				}