RegularDFADefinition.cs
69 lines
| 2.2 KiB
| text/x-csharp
|
CSharpLexer
cin
|
r164 | using System; | ||
|
cin
|
r170 | using System.Collections.Generic; | ||
| using System.Linq; | ||||
|
cin
|
r164 | |||
| namespace Implab.Automaton.RegularExpressions { | ||||
|
cin
|
r169 | public class RegularDFADefinition<TInput, TTag> : DFATable { | ||
|
cin
|
r164 | |||
|
cin
|
r170 | readonly Dictionary<int,TTag[]> m_tags = new Dictionary<int, TTag[]>(); | ||
|
cin
|
r164 | readonly IAlphabet<TInput> m_alphabet; | ||
|
cin
|
r165 | public RegularDFADefinition(IAlphabet<TInput> alphabet) { | ||
|
cin
|
r164 | Safe.ArgumentNotNull(alphabet, "aplhabet"); | ||
| m_alphabet = alphabet; | ||||
| } | ||||
| public IAlphabet<TInput> InputAlphabet { | ||||
| get { | ||||
| return m_alphabet; | ||||
| } | ||||
| } | ||||
|
cin
|
r169 | protected override DFAStateDescriptior[] ConstructTransitionTable() { | ||
|
cin
|
r164 | if (InputAlphabet.Count != m_alphabet.Count) | ||
| throw new InvalidOperationException("The alphabet doesn't match the transition table"); | ||||
| return base.ConstructTransitionTable(); | ||||
| } | ||||
|
cin
|
r170 | public void MarkFinalState(int s, TTag[] tags) { | ||
| MarkFinalState(s); | ||||
| SetStateTag(s, tags); | ||||
| } | ||||
| public void SetStateTag(int s, TTag[] tags) { | ||||
| Safe.ArgumentNotNull(tags, "tags"); | ||||
| m_tags[s] = tags; | ||||
| } | ||||
| public TTag[] GetStateTag(int s) { | ||||
| TTag[] tags; | ||||
| return m_tags.TryGetValue(s, out tags) ? tags : new TTag[0]; | ||||
| } | ||||
|
cin
|
r164 | /// <summary> | ||
| /// Optimize the specified alphabet. | ||||
| /// </summary> | ||||
| /// <param name="alphabet">Пустой алфавит, который будет зполнен в процессе оптимизации.</param> | ||||
|
cin
|
r170 | public RegularDFADefinition<TInput,TTag> Optimize(IAlphabetBuilder<TInput> alphabet) { | ||
|
cin
|
r164 | Safe.ArgumentNotNull(alphabet, "alphabet"); | ||
|
cin
|
r170 | |||
| var dfaTable = new RegularDFADefinition<TInput, TTag>(alphabet); | ||||
| var states = new DummyAlphabet(StateCount); | ||||
| var map = new MapAlphabet<int>(); | ||||
|
cin
|
r164 | |||
|
cin
|
r170 | Optimize(dfaTable, InputAlphabet, alphabet, states, map); | ||
| foreach (var g in m_tags.Where(x => x.Key < StateCount).GroupBy(x => map.Translate(x.Key), x => x.Value )) | ||||
| dfaTable.SetStateTag(g.Key, g.SelectMany(x => x).ToArray()); | ||||
| return dfaTable; | ||||
|
cin
|
r164 | } | ||
| } | ||||
| } | ||||