@@ -0,0 +1,30 | |||
|
1 | using System; | |
|
2 | using System.IO; | |
|
3 | ||
|
4 | namespace Implab.Formats { | |
|
5 | public class ReaderScanner: TextScanner { | |
|
6 | const int CHUNK_SIZE = 1024; | |
|
7 | const int BUFFER_MAX = CHUNK_SIZE*1024; | |
|
8 | ||
|
9 | readonly TextReader m_reader; | |
|
10 | ||
|
11 | public ReaderScanner(TextReader reader, int limit, int chunk) : base(limit, chunk) { | |
|
12 | Safe.ArgumentNotNull(reader, "reader"); | |
|
13 | m_reader = reader; | |
|
14 | } | |
|
15 | ||
|
16 | public ReaderScanner(TextReader reader) : this(reader, BUFFER_MAX, CHUNK_SIZE) { | |
|
17 | } | |
|
18 | ||
|
19 | protected override int Read(char[] buffer, int offset, int size) { | |
|
20 | return m_reader.Read(buffer, offset, size); | |
|
21 | } | |
|
22 | ||
|
23 | protected override void Dispose(bool disposing) { | |
|
24 | if (disposing) | |
|
25 | Safe.Dispose(m_reader); | |
|
26 | base.Dispose(disposing); | |
|
27 | } | |
|
28 | } | |
|
29 | } | |
|
30 |
@@ -0,0 +1,24 | |||
|
1 | using System; | |
|
2 | ||
|
3 | namespace Implab.Formats { | |
|
4 | public class ScannerContext<TTag> { | |
|
5 | public int[,] Dfa { get; private set; } | |
|
6 | public bool[] Final { get; private set; } | |
|
7 | public TTag[][] Tags { get; private set; } | |
|
8 | public int State { get; private set; } | |
|
9 | public int[] Alphabet { get; private set; } | |
|
10 | ||
|
11 | public ScannerContext(int[,] dfa, bool[] final, TTag[][] tags, int state, int[] alphabet) { | |
|
12 | Dfa = dfa; | |
|
13 | Final = final; | |
|
14 | Tags = tags; | |
|
15 | State = state; | |
|
16 | Alphabet = alphabet; | |
|
17 | } | |
|
18 | ||
|
19 | public bool Execute(TextScanner scanner, out TTag[] tag) { | |
|
20 | return scanner.ReadToken(Dfa, Final, Tags, State, Alphabet, out tag); | |
|
21 | } | |
|
22 | } | |
|
23 | } | |
|
24 |
@@ -0,0 +1,26 | |||
|
1 | using System; | |
|
2 | ||
|
3 | namespace Implab.Formats { | |
|
4 | public class StringScanner: TextScanner { | |
|
5 | const int CHUNK_SIZE = 1024; | |
|
6 | ||
|
7 | readonly string m_text; | |
|
8 | int m_pos; | |
|
9 | ||
|
10 | public StringScanner(string text) : base(text.Length, text.Length < CHUNK_SIZE ? text.Length : CHUNK_SIZE) { | |
|
11 | m_text = text; | |
|
12 | Feed(); | |
|
13 | } | |
|
14 | ||
|
15 | protected override int Read(char[] buffer, int offset, int size) { | |
|
16 | var actual = size + m_pos > m_text.Length ? m_text.Length - m_pos : size; | |
|
17 | ||
|
18 | m_text.CopyTo(m_pos,buffer,offset, actual); | |
|
19 | ||
|
20 | m_pos += actual; | |
|
21 | ||
|
22 | return actual; | |
|
23 | } | |
|
24 | } | |
|
25 | } | |
|
26 |
@@ -1,305 +1,313 | |||
|
1 | 1 | using Implab; |
|
2 | 2 | using System; |
|
3 | 3 | using System.Collections.Generic; |
|
4 | 4 | using System.Linq; |
|
5 | 5 | |
|
6 | 6 | namespace Implab.Automaton { |
|
7 | 7 | public class DFATable : IDFATableBuilder { |
|
8 | 8 | int m_stateCount; |
|
9 | 9 | int m_symbolCount; |
|
10 | 10 | int m_initialState; |
|
11 | 11 | |
|
12 | 12 | readonly HashSet<int> m_finalStates = new HashSet<int>(); |
|
13 | 13 | readonly HashSet<AutomatonTransition> m_transitions = new HashSet<AutomatonTransition>(); |
|
14 | 14 | |
|
15 | 15 | |
|
16 | 16 | #region IDFADefinition implementation |
|
17 | 17 | |
|
18 | 18 | public bool IsFinalState(int s) { |
|
19 | 19 | Safe.ArgumentInRange(s, 0, m_stateCount, "s"); |
|
20 | 20 | |
|
21 | 21 | return m_finalStates.Contains(s); |
|
22 | 22 | } |
|
23 | 23 | |
|
24 | 24 | public IEnumerable<int> FinalStates { |
|
25 | 25 | get { |
|
26 | 26 | return m_finalStates; |
|
27 | 27 | } |
|
28 | 28 | } |
|
29 | 29 | |
|
30 | 30 | public int StateCount { |
|
31 | 31 | get { return m_stateCount; } |
|
32 | 32 | } |
|
33 | 33 | |
|
34 | 34 | public int AlphabetSize { |
|
35 | 35 | get { return m_symbolCount; } |
|
36 | 36 | } |
|
37 | 37 | |
|
38 | 38 | public int InitialState { |
|
39 | 39 | get { return m_initialState; } |
|
40 | 40 | } |
|
41 | 41 | |
|
42 | 42 | #endregion |
|
43 | 43 | |
|
44 | 44 | public void SetInitialState(int s) { |
|
45 | 45 | Safe.ArgumentAssert(s >= 0, "s"); |
|
46 | 46 | m_initialState = s; |
|
47 | 47 | } |
|
48 | 48 | |
|
49 | 49 | public void MarkFinalState(int state) { |
|
50 | 50 | m_finalStates.Add(state); |
|
51 | 51 | } |
|
52 | 52 | |
|
53 | 53 | public void Add(AutomatonTransition item) { |
|
54 | 54 | Safe.ArgumentAssert(item.s1 >= 0, "item"); |
|
55 | 55 | Safe.ArgumentAssert(item.s2 >= 0, "item"); |
|
56 | 56 | Safe.ArgumentAssert(item.edge >= 0, "item"); |
|
57 | 57 | |
|
58 | 58 | m_stateCount = Math.Max(m_stateCount, Math.Max(item.s1, item.s2) + 1); |
|
59 | 59 | m_symbolCount = Math.Max(m_symbolCount, item.edge); |
|
60 | 60 | |
|
61 | 61 | m_transitions.Add(item); |
|
62 | 62 | } |
|
63 | 63 | |
|
64 | 64 | public void Clear() { |
|
65 | 65 | m_stateCount = 0; |
|
66 | 66 | m_symbolCount = 0; |
|
67 | 67 | m_finalStates.Clear(); |
|
68 | 68 | m_transitions.Clear(); |
|
69 | 69 | } |
|
70 | 70 | |
|
71 | 71 | public bool Contains(AutomatonTransition item) { |
|
72 | 72 | return m_transitions.Contains(item); |
|
73 | 73 | } |
|
74 | 74 | |
|
75 | 75 | public void CopyTo(AutomatonTransition[] array, int arrayIndex) { |
|
76 | 76 | m_transitions.CopyTo(array, arrayIndex); |
|
77 | 77 | } |
|
78 | 78 | |
|
79 | 79 | public bool Remove(AutomatonTransition item) { |
|
80 | 80 | m_transitions.Remove(item); |
|
81 | 81 | } |
|
82 | 82 | |
|
83 | 83 | public int Count { |
|
84 | 84 | get { |
|
85 | 85 | return m_transitions.Count; |
|
86 | 86 | } |
|
87 | 87 | } |
|
88 | 88 | |
|
89 | 89 | public bool IsReadOnly { |
|
90 | 90 | get { |
|
91 | 91 | return false; |
|
92 | 92 | } |
|
93 | 93 | } |
|
94 | 94 | |
|
95 | 95 | public IEnumerator<AutomatonTransition> GetEnumerator() { |
|
96 | 96 | return m_transitions.GetEnumerator(); |
|
97 | 97 | } |
|
98 | 98 | |
|
99 | 99 | System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator() { |
|
100 | 100 | return GetEnumerator(); |
|
101 | 101 | } |
|
102 | 102 | |
|
103 |
public |
|
|
104 |
var table = new |
|
|
103 | public int[,] CreateTransitionTable() { | |
|
104 | var table = new int[StateCount,AlphabetSize]; | |
|
105 | ||
|
106 | for (int i = 0; i < StateCount; i++) | |
|
107 | for (int j = 0; i < AlphabetSize; j++) | |
|
108 | table[i, j] = DFAConst.UNREACHABLE_STATE; | |
|
105 | 109 | |
|
106 |
foreach (var t in this) |
|
|
107 |
|
|
|
108 | table[t.s1] = new DFAStateDescriptor(AlphabetSize, IsFinalState(t.s1)); | |
|
109 | if (table[t.s2].transitions == null) | |
|
110 | table[t.s2] = new DFAStateDescriptor(AlphabetSize, IsFinalState(t.s2)); | |
|
111 | table[t.s1].transitions[t.edge] = t.s2; | |
|
110 | foreach (var t in this) | |
|
111 | table[t.s1,t.edge] = t.s2; | |
|
112 | ||
|
113 | return table; | |
|
112 | 114 |
|
|
113 | 115 | |
|
116 | public bool[] CreateFinalStateTable() { | |
|
117 | var table = new bool[StateCount]; | |
|
118 | ||
|
119 | foreach (var s in FinalStates) | |
|
120 | table[s] = true; | |
|
121 | ||
|
114 | 122 | return table; |
|
115 | 123 | } |
|
116 | 124 | |
|
117 | 125 | /// <summary>Формирует множества конечных состояний перед началом работы алгоритма минимизации.</summary> |
|
118 | 126 | /// <remarks> |
|
119 | 127 | /// В процессе построения минимального автомата требуется разделить множество состояний, |
|
120 | 128 | /// на два подмножества - конечные состояния и все остальные, после чего эти подмножества |
|
121 | 129 | /// будут резделены на более мелкие. Иногда требуется гарантировать различия конечных сосотяний, |
|
122 | 130 | /// для этого необходимо переопределить даннцю фукнцию, для получения множеств конечных состояний. |
|
123 | 131 | /// </remarks> |
|
124 | 132 | /// <returns>The final states.</returns> |
|
125 | 133 | protected virtual IEnumerable<HashSet<int>> GroupFinalStates() { |
|
126 | 134 | return new HashSet<int>[] { m_finalStates }; |
|
127 | 135 | } |
|
128 | 136 | |
|
129 | 137 | protected void Optimize( |
|
130 | 138 | IDFATableBuilder optimalDFA, |
|
131 | 139 | IDictionary<int,int> alphabetMap, |
|
132 | 140 | IDictionary<int,int> stateMap |
|
133 | 141 | ) { |
|
134 | 142 | Safe.ArgumentNotNull(optimalDFA, "dfa"); |
|
135 | 143 | Safe.ArgumentNotNull(alphabetMap, "alphabetMap"); |
|
136 | 144 | Safe.ArgumentNotNull(stateMap, "stateMap"); |
|
137 | 145 | |
|
138 | 146 | |
|
139 | 147 | var setComparer = new CustomEqualityComparer<HashSet<int>>( |
|
140 | 148 | (x, y) => x.SetEquals(y), |
|
141 | 149 | s => s.Sum(x => x.GetHashCode()) |
|
142 | 150 | ); |
|
143 | 151 | |
|
144 | 152 | var optimalStates = new HashSet<HashSet<int>>(setComparer); |
|
145 | 153 | var queue = new HashSet<HashSet<int>>(setComparer); |
|
146 | 154 | |
|
147 | 155 | // получаем конечные состояния, сгруппированные по маркерам |
|
148 | 156 | optimalStates.UnionWith( |
|
149 | 157 | GroupFinalStates() |
|
150 | 158 | ); |
|
151 | 159 | |
|
152 | 160 | var state = new HashSet<int>( |
|
153 | 161 | Enumerable |
|
154 | 162 | .Range(0, m_stateCount - 1) |
|
155 | 163 | .Where(i => !m_finalStates.Contains(i)) |
|
156 | 164 | ); |
|
157 | 165 | |
|
158 | 166 | optimalStates.Add(state); |
|
159 | 167 | queue.Add(state); |
|
160 | 168 | |
|
161 | 169 | var rmap = m_transitions |
|
162 | 170 | .GroupBy(t => t.s2) |
|
163 | 171 | .ToLookup( |
|
164 | 172 | g => g.Key, // s2 |
|
165 | 173 | g => g.ToLookup(t => t.edge, t => t.s1) |
|
166 | 174 | ); |
|
167 | 175 | |
|
168 | 176 | while (queue.Count > 0) { |
|
169 | 177 | var stateA = queue.First(); |
|
170 | 178 | queue.Remove(stateA); |
|
171 | 179 | |
|
172 | 180 | for (int c = 0; c < m_symbolCount; c++) { |
|
173 | 181 | var stateX = new HashSet<int>(); |
|
174 | 182 | foreach(var a in stateA) |
|
175 | 183 | stateX.UnionWith(rmap[a][c]); // all states from wich 'c' leads to 'a' |
|
176 | 184 | |
|
177 | 185 | foreach (var stateY in optimalStates.ToArray()) { |
|
178 | 186 | if (stateX.Overlaps(stateY) && !stateY.IsSubsetOf(stateX)) { |
|
179 | 187 | var stateR1 = new HashSet<int>(stateY); |
|
180 | 188 | var stateR2 = new HashSet<int>(stateY); |
|
181 | 189 | |
|
182 | 190 | stateR1.IntersectWith(stateX); |
|
183 | 191 | stateR2.ExceptWith(stateX); |
|
184 | 192 | |
|
185 | 193 | optimalStates.Remove(stateY); |
|
186 | 194 | optimalStates.Add(stateR1); |
|
187 | 195 | optimalStates.Add(stateR2); |
|
188 | 196 | |
|
189 | 197 | if (queue.Contains(stateY)) { |
|
190 | 198 | queue.Remove(stateY); |
|
191 | 199 | queue.Add(stateR1); |
|
192 | 200 | queue.Add(stateR2); |
|
193 | 201 | } else { |
|
194 | 202 | queue.Add(stateR1.Count <= stateR2.Count ? stateR1 : stateR2); |
|
195 | 203 | } |
|
196 | 204 | } |
|
197 | 205 | } |
|
198 | 206 | } |
|
199 | 207 | } |
|
200 | 208 | |
|
201 | 209 | // карта получения оптимального состояния по соотвествующему ему простому состоянию |
|
202 | 210 | var nextState = 0; |
|
203 | 211 | foreach (var item in optimalStates) { |
|
204 | 212 | var id = nextState++; |
|
205 | 213 | foreach (var s in item) |
|
206 | 214 | stateMap[s] = id; |
|
207 | 215 | } |
|
208 | 216 | |
|
209 | 217 | // получаем минимальный алфавит |
|
210 | 218 | // входные символы не различимы, если Move(s,a1) == Move(s,a2), для любого s |
|
211 | 219 | // для этого используем алгоритм кластеризации, сначала |
|
212 | 220 | // считаем, что все символы не различимы |
|
213 | 221 | |
|
214 | 222 | var minClasses = new HashSet<HashSet<int>>(setComparer); |
|
215 | 223 | var alphaQueue = new Queue<HashSet<int>>(); |
|
216 | 224 | alphaQueue.Enqueue(new HashSet<int>(Enumerable.Range(0,AlphabetSize))); |
|
217 | 225 | |
|
218 | 226 | // для всех состояний, будем проверять каждый класс на различимость, |
|
219 | 227 | // т.е. символы различимы, если они приводят к разным состояниям |
|
220 | 228 | for (int s = 0 ; s < optimalStates.Count; s++) { |
|
221 | 229 | var newQueue = new Queue<HashSet<int>>(); |
|
222 | 230 | |
|
223 | 231 | foreach (var A in alphaQueue) { |
|
224 | 232 | // классы из одного символа делить бесполезно, переводим их сразу в |
|
225 | 233 | // результирующий алфавит |
|
226 | 234 | if (A.Count == 1) { |
|
227 | 235 | minClasses.Add(A); |
|
228 | 236 | continue; |
|
229 | 237 | } |
|
230 | 238 | |
|
231 | 239 | // различаем классы символов, которые переводят в различные оптимальные состояния |
|
232 | 240 | // optimalState -> alphaClass |
|
233 | 241 | var classes = new Dictionary<int, HashSet<int>>(); |
|
234 | 242 | |
|
235 | 243 | foreach (var term in A) { |
|
236 | 244 | // ищем все переходы класса по символу term |
|
237 | 245 | var res = m_transitions.Where(t => stateMap[t.s1] == s && t.edge == term).Select(t => stateMap[t.s2]).ToArray(); |
|
238 | 246 | |
|
239 | 247 | var s2 = res.Length > 0 ? res[0] : -1; |
|
240 | 248 | |
|
241 | 249 | HashSet<int> a2; |
|
242 | 250 | if (!classes.TryGetValue(s2, out a2)) { |
|
243 | 251 | a2 = new HashSet<int>(); |
|
244 | 252 | newQueue.Enqueue(a2); |
|
245 | 253 | classes[s2] = a2; |
|
246 | 254 | } |
|
247 | 255 | a2.Add(term); |
|
248 | 256 | } |
|
249 | 257 | } |
|
250 | 258 | |
|
251 | 259 | if (newQueue.Count == 0) |
|
252 | 260 | break; |
|
253 | 261 | alphaQueue = newQueue; |
|
254 | 262 | } |
|
255 | 263 | |
|
256 | 264 | // после окончания работы алгоритма в очереди останутся минимальные различимые классы |
|
257 | 265 | // входных символов |
|
258 | 266 | foreach (var A in alphaQueue) |
|
259 | 267 | minClasses.Add(A); |
|
260 | 268 | |
|
261 | 269 | // построение отображения алфавитов входных символов. |
|
262 | 270 | // поскольку символ DFAConst.UNCLASSIFIED_INPUT может иметь |
|
263 | 271 | // специальное значение, тогда сохраним минимальный класс, |
|
264 | 272 | // содержащий этот символ на томже месте. |
|
265 | 273 | |
|
266 | 274 | var nextCls = 0; |
|
267 | 275 | foreach (var item in minClasses) { |
|
268 | 276 | if (nextCls == DFAConst.UNCLASSIFIED_INPUT) |
|
269 | 277 | nextCls++; |
|
270 | 278 | |
|
271 | 279 | // сохраняем DFAConst.UNCLASSIFIED_INPUT |
|
272 | 280 | var cls = item.Contains(DFAConst.UNCLASSIFIED_INPUT) ? DFAConst.UNCLASSIFIED_INPUT : nextCls; |
|
273 | 281 | |
|
274 | 282 | foreach (var a in item) |
|
275 | 283 | alphabetMap[a] = cls; |
|
276 | 284 | |
|
277 | 285 | nextCls++; |
|
278 | 286 | } |
|
279 | 287 | |
|
280 | 288 | // построение автомата |
|
281 | 289 | optimalDFA.SetInitialState(stateMap[m_initialState]); |
|
282 | 290 | |
|
283 | 291 | foreach (var sf in m_finalStates.Select(s => stateMap[s]).Distinct()) |
|
284 | 292 | optimalDFA.MarkFinalState(sf); |
|
285 | 293 | |
|
286 | 294 | foreach (var t in m_transitions.Select(t => new AutomatonTransition(stateMap[t.s1],stateMap[t.s2],alphabetMap[t.edge])).Distinct()) |
|
287 | 295 | optimalDFA.Add(t); |
|
288 | 296 | } |
|
289 | 297 | |
|
290 | 298 | protected void PrintDFA<TInput, TState>(IAlphabet<TInput> inputAlphabet, IAlphabet<TState> stateAlphabet) { |
|
291 | 299 | Safe.ArgumentNotNull(inputAlphabet, "inputAlphabet"); |
|
292 | 300 | Safe.ArgumentNotNull(stateAlphabet, "stateAlphabet"); |
|
293 | 301 | |
|
294 | 302 | foreach(var t in m_transitions) |
|
295 | 303 | Console.WriteLine( |
|
296 | 304 | "[{0}] -{{{1}}}-> [{2}]{3}", |
|
297 | 305 | String.Join(",", stateAlphabet.GetSymbols(t.s1)), |
|
298 | 306 | String.Join("", inputAlphabet.GetSymbols(t.edge)), |
|
299 | 307 | String.Join(",", stateAlphabet.GetSymbols(t.s2)), |
|
300 | 308 | m_finalStates.Contains(t.s2) ? "$" : "" |
|
301 | 309 | ); |
|
302 | 310 | } |
|
303 | 311 | |
|
304 | 312 | } |
|
305 | 313 | } |
@@ -1,94 +1,50 | |||
|
1 | 1 | using Implab; |
|
2 | 2 | using System; |
|
3 | 3 | using System.Collections.Generic; |
|
4 | 4 | using System.Diagnostics; |
|
5 | 5 | using System.Linq; |
|
6 | 6 | |
|
7 | 7 | namespace Implab.Automaton { |
|
8 | 8 | /// <summary> |
|
9 | 9 | /// Indexed alphabet is the finite set of symbols where each symbol has a zero-based unique index. |
|
10 | 10 | /// </summary> |
|
11 | 11 | /// <remarks> |
|
12 | 12 | /// Indexed alphabets are usefull in bulting efficient translations from source alphabet |
|
13 | 13 | /// to the input alphabet of the automaton. It's assumed that the index to the symbol match |
|
14 | 14 | /// is well known and documented. |
|
15 | 15 | /// </remarks> |
|
16 |
public abstract class IndexedAlphabetBase<T> : |
|
|
17 | int m_nextId = 1; | |
|
18 | readonly int[] m_map; | |
|
19 | ||
|
20 | protected IndexedAlphabetBase(int mapSize) { | |
|
21 | m_map = new int[mapSize]; | |
|
22 | } | |
|
23 | ||
|
24 | protected IndexedAlphabetBase(int[] map) { | |
|
25 | Debug.Assert(map != null && map.Length > 0); | |
|
26 | Debug.Assert(map.All(x => x >= 0)); | |
|
27 | ||
|
28 | m_map = map; | |
|
29 | m_nextId = map.Max() + 1; | |
|
30 | } | |
|
31 | ||
|
32 | public int DefineSymbol(T symbol) { | |
|
33 | var index = GetSymbolIndex(symbol); | |
|
34 | if (m_map[index] == DFAConst.UNCLASSIFIED_INPUT) | |
|
35 | m_map[index] = m_nextId++; | |
|
36 | return m_map[index]; | |
|
37 | } | |
|
38 | ||
|
39 | public int DefineSymbol(T symbol, int cls) { | |
|
40 | var index = GetSymbolIndex(symbol); | |
|
41 | m_map[index] = cls; | |
|
42 | m_nextId = Math.Max(cls + 1, m_nextId); | |
|
43 | return cls; | |
|
44 | } | |
|
16 | public abstract class IndexedAlphabetBase<T> : MapAlphabet<T> { | |
|
45 | 17 | |
|
46 | public int DefineClass(IEnumerable<T> symbols) { | |
|
47 | return DefineClass(symbols, m_nextId); | |
|
48 | } | |
|
49 | ||
|
50 | public int DefineClass(IEnumerable<T> symbols, int cls) { | |
|
51 | Safe.ArgumentNotNull(symbols, "symbols"); | |
|
52 | symbols = symbols.Distinct(); | |
|
53 | ||
|
54 | foreach (var symbol in symbols) | |
|
55 | m_map[GetSymbolIndex(symbol)] = cls; | |
|
56 | ||
|
57 | m_nextId = Math.Max(cls + 1, m_nextId); | |
|
58 | ||
|
59 | return cls; | |
|
60 | } | |
|
61 | ||
|
62 | public virtual int Translate(T symbol) { | |
|
63 | return m_map[GetSymbolIndex(symbol)]; | |
|
64 | } | |
|
65 | ||
|
66 | public int Count { | |
|
67 | get { return m_nextId; } | |
|
68 | } | |
|
69 | ||
|
70 | public bool Contains(T symbol) { | |
|
71 | return true; | |
|
72 | } | |
|
73 | ||
|
74 | public IEnumerable<T> GetSymbols(int cls) { | |
|
75 | for (var i = 0; i < m_map.Length; i++) | |
|
76 | if (m_map[i] == cls) | |
|
77 | yield return GetSymbolByIndex(i); | |
|
18 | protected IndexedAlphabetBase() :base(true, null) { | |
|
78 | 19 | } |
|
79 | 20 | |
|
80 | 21 | public abstract int GetSymbolIndex(T symbol); |
|
81 | 22 | |
|
82 | public abstract T GetSymbolByIndex(int index); | |
|
83 | ||
|
84 | public abstract IEnumerable<T> InputSymbols { get; } | |
|
85 | ||
|
86 | 23 | /// <summary> |
|
87 | 24 | /// Gets the translation map from the index of the symbol to it's class this is usefull for the optimized input symbols transtaion. |
|
88 | 25 | /// </summary> |
|
26 | /// <remarks> | |
|
27 | /// The map is continous and start from the symbol with zero code. The last symbol | |
|
28 | /// in the map is the last classified symbol in the alphabet, i.e. the map can be | |
|
29 | /// shorter then the whole alphabet. | |
|
30 | /// </remarks> | |
|
89 | 31 | /// <returns>The translation map.</returns> |
|
90 | 32 | public int[] GetTranslationMap() { |
|
91 | return m_map; | |
|
33 | Dictionary<int,int> map = new Dictionary<int, int>(); | |
|
34 | ||
|
35 | int max; | |
|
36 | foreach (var p in Mappings) { | |
|
37 | var index = GetSymbolIndex(p.Key); | |
|
38 | max = Math.Max(max, index); | |
|
39 | map[index] = p.Value; | |
|
40 | } | |
|
41 | ||
|
42 | var result = new int[max + 1]; | |
|
43 | ||
|
44 | for (int i = 0; i < result.Length; i++) | |
|
45 | map.TryGetValue(i, out result[i]); | |
|
46 | ||
|
47 | return result; | |
|
92 | 48 | } |
|
93 | 49 | } |
|
94 | 50 | } |
@@ -1,77 +1,84 | |||
|
1 | 1 | using System; |
|
2 | 2 | using System.Collections.Generic; |
|
3 | 3 | using System.Linq; |
|
4 | 4 | |
|
5 | 5 | namespace Implab.Automaton { |
|
6 | 6 | public class MapAlphabet<T> : IAlphabetBuilder<T> { |
|
7 | 7 | readonly Dictionary<T,int> m_map; |
|
8 | 8 | int m_nextCls; |
|
9 | 9 | readonly bool m_supportUnclassified; |
|
10 | 10 | |
|
11 | 11 | public MapAlphabet(bool supportUnclassified, IEqualityComparer<T> comparer) { |
|
12 | 12 | m_map = comparer != null ? new Dictionary<T, int>(comparer) : new Dictionary<T,int>(); |
|
13 | 13 | m_supportUnclassified = supportUnclassified; |
|
14 | 14 | m_nextCls = supportUnclassified ? 1 : 0; |
|
15 | 15 | } |
|
16 | 16 | |
|
17 | 17 | #region IAlphabetBuilder implementation |
|
18 | 18 | |
|
19 | 19 | public int DefineSymbol(T symbol) { |
|
20 | 20 | int cls; |
|
21 | 21 | return m_map.TryGetValue(symbol, out cls) ? cls : DefineSymbol(symbol, m_nextCls); |
|
22 | 22 | } |
|
23 | 23 | |
|
24 | 24 | public int DefineSymbol(T symbol, int cls) { |
|
25 | 25 | Safe.ArgumentAssert(cls >= 0, "cls"); |
|
26 | 26 | |
|
27 | 27 | m_nextCls = Math.Max(cls + 1, m_nextCls); |
|
28 | 28 | m_map.Add(symbol, cls); |
|
29 | 29 | return cls; |
|
30 | 30 | } |
|
31 | 31 | |
|
32 | 32 | public int DefineClass(IEnumerable<T> symbols) { |
|
33 | 33 | return DefineClass(symbols, m_nextCls); |
|
34 | 34 | } |
|
35 | 35 | |
|
36 | 36 | public int DefineClass(IEnumerable<T> symbols, int cls) { |
|
37 | 37 | Safe.ArgumentAssert(cls >= 0, "cls"); |
|
38 | 38 | Safe.ArgumentNotNull(symbols, "symbols"); |
|
39 | 39 | |
|
40 | 40 | m_nextCls = Math.Max(cls + 1, m_nextCls); |
|
41 | 41 | |
|
42 | 42 | foreach (var symbol in symbols) |
|
43 | 43 | m_map[symbol] = cls; |
|
44 | 44 | return cls; |
|
45 | 45 | } |
|
46 | 46 | |
|
47 | 47 | #endregion |
|
48 | 48 | |
|
49 | 49 | #region IAlphabet implementation |
|
50 | 50 | |
|
51 | 51 | public int Translate(T symbol) { |
|
52 | 52 | int cls; |
|
53 | 53 | if (m_map.TryGetValue(symbol, out cls)) |
|
54 | 54 | return cls; |
|
55 | 55 | if (!m_supportUnclassified) |
|
56 | 56 | throw new ArgumentOutOfRangeException("symbol", "The specified symbol isn't in the alphabet"); |
|
57 | 57 | return DFAConst.UNCLASSIFIED_INPUT; |
|
58 | 58 | } |
|
59 | 59 | |
|
60 | 60 | public int Count { |
|
61 | 61 | get { |
|
62 | 62 | return m_nextCls; |
|
63 | 63 | } |
|
64 | 64 | } |
|
65 | 65 | |
|
66 | 66 | public bool Contains(T symbol) { |
|
67 | 67 | return m_supportUnclassified || m_map.ContainsKey(symbol); |
|
68 | 68 | } |
|
69 | 69 | |
|
70 | 70 | |
|
71 | 71 | public IEnumerable<T> GetSymbols(int cls) { |
|
72 | Safe.ArgumentAssert(cls > 0, "cls"); | |
|
72 | 73 | return m_map.Where(p => p.Value == cls).Select(p => p.Key); |
|
73 | 74 | } |
|
74 | 75 | #endregion |
|
76 | ||
|
77 | public IEnumerable<KeyValuePair<T,int>> Mappings { | |
|
78 | get { | |
|
79 | return m_map; | |
|
80 | } | |
|
81 | } | |
|
75 | 82 | } |
|
76 | 83 | } |
|
77 | 84 |
@@ -1,89 +1,98 | |||
|
1 | 1 | using Implab; |
|
2 | 2 | using System; |
|
3 | 3 | using System.Collections.Generic; |
|
4 | 4 | using System.Linq; |
|
5 | 5 | |
|
6 | 6 | namespace Implab.Automaton.RegularExpressions { |
|
7 | 7 | /// <summary> |
|
8 | 8 | /// Базовый абстрактный класс. Грамматика, позволяет формулировать выражения над алфавитом типа <c>char</c>. |
|
9 | 9 | /// </summary> |
|
10 | 10 | public abstract class Grammar<TSymbol, TTag> { |
|
11 | 11 | |
|
12 | 12 | protected abstract IAlphabetBuilder<TSymbol> AlphabetBuilder { |
|
13 | 13 | get; |
|
14 | 14 | } |
|
15 | 15 | |
|
16 | 16 | protected SymbolToken<TTag> UnclassifiedToken() { |
|
17 | 17 | return new SymbolToken<TTag>(DFAConst.UNCLASSIFIED_INPUT); |
|
18 | 18 | } |
|
19 | 19 | |
|
20 | 20 | protected void DefineAlphabet(IEnumerable<TSymbol> alphabet) { |
|
21 | 21 | Safe.ArgumentNotNull(alphabet, "alphabet"); |
|
22 | 22 | |
|
23 | 23 | foreach (var ch in alphabet) |
|
24 | 24 | AlphabetBuilder.DefineSymbol(ch); |
|
25 | 25 | } |
|
26 | 26 | |
|
27 | 27 | protected Token<TTag> SymbolToken(TSymbol symbol) { |
|
28 | 28 | return Token<TTag>.New(TranslateOrAdd(symbol)); |
|
29 | 29 | } |
|
30 | 30 | |
|
31 | 31 | protected Token<TTag> SymbolToken(IEnumerable<TSymbol> symbols) { |
|
32 | 32 | Safe.ArgumentNotNull(symbols, "symbols"); |
|
33 | 33 | |
|
34 | 34 | return Token<TTag>.New(TranslateOrAdd(symbols).ToArray()); |
|
35 | 35 | } |
|
36 | 36 | |
|
37 | 37 | protected Token<TTag> SymbolSetToken(params TSymbol[] set) { |
|
38 | 38 | return SymbolToken(set); |
|
39 | 39 | } |
|
40 | 40 | |
|
41 | 41 | int TranslateOrAdd(TSymbol ch) { |
|
42 | 42 | var t = AlphabetBuilder.Translate(ch); |
|
43 | 43 | if (t == DFAConst.UNCLASSIFIED_INPUT) |
|
44 | 44 | t = AlphabetBuilder.DefineSymbol(ch); |
|
45 | 45 | return t; |
|
46 | 46 | } |
|
47 | 47 | |
|
48 | 48 | IEnumerable<int> TranslateOrAdd(IEnumerable<TSymbol> symbols) { |
|
49 | 49 | return symbols.Distinct().Select(TranslateOrAdd); |
|
50 | 50 | } |
|
51 | 51 | |
|
52 | 52 | int TranslateOrDie(TSymbol ch) { |
|
53 | 53 | var t = AlphabetBuilder.Translate(ch); |
|
54 | 54 | if (t == DFAConst.UNCLASSIFIED_INPUT) |
|
55 | 55 | throw new ApplicationException(String.Format("Symbol '{0}' is UNCLASSIFIED", ch)); |
|
56 | 56 | return t; |
|
57 | 57 | } |
|
58 | 58 | |
|
59 | 59 | IEnumerable<int> TranslateOrDie(IEnumerable<TSymbol> symbols) { |
|
60 | 60 | return symbols.Distinct().Select(TranslateOrDie); |
|
61 | 61 | } |
|
62 | 62 | |
|
63 | 63 | protected Token<TTag> SymbolTokenExcept(IEnumerable<TSymbol> symbols) { |
|
64 | 64 | Safe.ArgumentNotNull(symbols, "symbols"); |
|
65 | 65 | |
|
66 | 66 | return Token<TTag>.New( Enumerable.Range(0, AlphabetBuilder.Count).Except(TranslateOrDie(symbols)).ToArray() ); |
|
67 | 67 | } |
|
68 | 68 | |
|
69 |
protected abstract IAlphabetB |
|
|
69 | protected abstract IndexedAlphabetBase<TSymbol> CreateAlphabet(); | |
|
70 | 70 | |
|
71 |
protected |
|
|
71 | protected ScannerContext<TTag> BuildScannerContext(Token<TTag> regexp) { | |
|
72 | 72 | |
|
73 | 73 | var dfa = new RegularDFA<TSymbol, TTag>(AlphabetBuilder); |
|
74 | 74 | |
|
75 | 75 | var visitor = new RegularExpressionVisitor<TTag>(); |
|
76 | 76 | regexp.Accept( visitor ); |
|
77 | 77 | |
|
78 | 78 | visitor.BuildDFA(dfa); |
|
79 | 79 | |
|
80 | 80 | if (dfa.IsFinalState(dfa.InitialState)) |
|
81 | 81 | throw new ApplicationException("The specified language contains empty token"); |
|
82 | 82 | |
|
83 |
r |
|
|
83 | var ab = CreateAlphabet(); | |
|
84 | var optimal = dfa.Optimize(ab); | |
|
85 | ||
|
86 | return new ScannerContext<TTag>( | |
|
87 | optimal.CreateTransitionTable(), | |
|
88 | optimal.CreateFinalStateTable(), | |
|
89 | optimal.CreateTagTable(), | |
|
90 | optimal.InitialState, | |
|
91 | ab.GetTranslationMap() | |
|
92 | ); | |
|
84 | 93 | } |
|
85 | 94 | |
|
86 | 95 | } |
|
87 | 96 | |
|
88 | 97 | |
|
89 | 98 | } |
@@ -1,89 +1,84 | |||
|
1 | 1 | using System; |
|
2 | 2 | using System.Collections.Generic; |
|
3 | 3 | using System.Linq; |
|
4 | 4 | |
|
5 | 5 | namespace Implab.Automaton.RegularExpressions { |
|
6 | 6 | public class RegularDFA<TInput, TTag> : DFATable, ITaggedDFABuilder<TTag> { |
|
7 | 7 | |
|
8 | 8 | readonly Dictionary<int,TTag[]> m_tags = new Dictionary<int, TTag[]>(); |
|
9 | 9 | readonly IAlphabet<TInput> m_alphabet; |
|
10 | 10 | |
|
11 | 11 | public RegularDFA(IAlphabet<TInput> alphabet) { |
|
12 | 12 | Safe.ArgumentNotNull(alphabet, "aplhabet"); |
|
13 | 13 | |
|
14 | 14 | m_alphabet = alphabet; |
|
15 | 15 | } |
|
16 | 16 | |
|
17 | 17 | |
|
18 | 18 | public IAlphabet<TInput> InputAlphabet { |
|
19 | 19 | get { |
|
20 | 20 | return m_alphabet; |
|
21 | 21 | } |
|
22 | 22 | } |
|
23 | 23 | |
|
24 | 24 | public void MarkFinalState(int s, TTag[] tags) { |
|
25 | 25 | MarkFinalState(s); |
|
26 | 26 | SetStateTag(s, tags); |
|
27 | 27 | } |
|
28 | 28 | |
|
29 | 29 | public void SetStateTag(int s, TTag[] tags) { |
|
30 | 30 | Safe.ArgumentNotNull(tags, "tags"); |
|
31 | 31 | m_tags[s] = tags; |
|
32 | 32 | } |
|
33 | 33 | |
|
34 | 34 | public TTag[] GetStateTag(int s) { |
|
35 | 35 | TTag[] tags; |
|
36 | 36 | return m_tags.TryGetValue(s, out tags) ? tags : new TTag[0]; |
|
37 | 37 | } |
|
38 | 38 | |
|
39 |
public |
|
|
40 |
var table = new |
|
|
39 | public TTag[][] CreateTagTable() { | |
|
40 | var table = new TTag[StateCount][]; | |
|
41 | 41 | |
|
42 |
foreach (var |
|
|
43 | if (table[t.s1].transitions == null) | |
|
44 | table[t.s1] = new DFAStateDescriptor<TTag>(AlphabetSize, IsFinalState(t.s1), GetStateTag(t.s1)); | |
|
45 | if (table[t.s2].transitions == null) | |
|
46 | table[t.s2] = new DFAStateDescriptor<TTag>(AlphabetSize, IsFinalState(t.s2), GetStateTag(t.s2)); | |
|
47 | table[t.s1].transitions[t.edge] = t.s2; | |
|
48 | } | |
|
42 | foreach (var pair in m_tags) | |
|
43 | table[pair.Key] = pair.Value; | |
|
49 | 44 | |
|
50 | 45 | return table; |
|
51 | 46 | } |
|
52 | 47 | |
|
53 | 48 | /// <summary> |
|
54 | 49 | /// Optimize the specified alphabet. |
|
55 | 50 | /// </summary> |
|
56 | 51 | /// <param name="alphabet">Пустой алфавит, который будет зполнен в процессе оптимизации.</param> |
|
57 | 52 | public RegularDFA<TInput,TTag> Optimize(IAlphabetBuilder<TInput> alphabet) { |
|
58 | 53 | Safe.ArgumentNotNull(alphabet, "alphabet"); |
|
59 | 54 | |
|
60 | 55 | var dfa = new RegularDFA<TInput, TTag>(alphabet); |
|
61 | 56 | |
|
62 | 57 | var states = new DummyAlphabet(StateCount); |
|
63 | 58 | var alphaMap = new Dictionary<int,int>(); |
|
64 | 59 | var stateMap = new Dictionary<int,int>(); |
|
65 | 60 | |
|
66 | 61 | Optimize(dfa, alphaMap, stateMap); |
|
67 | 62 | |
|
68 | 63 | // mark tags in the new DFA |
|
69 | 64 | foreach (var g in m_tags.Where(x => x.Key < StateCount).GroupBy(x => stateMap[x.Key], x => x.Value )) |
|
70 | 65 | dfa.SetStateTag(g.Key, g.SelectMany(x => x).ToArray()); |
|
71 | 66 | |
|
72 | 67 | // make the alphabet for the new DFA |
|
73 | 68 | foreach (var pair in alphaMap) |
|
74 | 69 | alphabet.DefineClass(m_alphabet.GetSymbols(pair.Key), pair.Value); |
|
75 | 70 | |
|
76 | 71 | return dfa; |
|
77 | 72 | } |
|
78 | 73 | |
|
79 | 74 | protected override IEnumerable<HashSet<int>> GroupFinalStates() { |
|
80 | 75 | var arrayComparer = new CustomEqualityComparer<TTag[]>( |
|
81 | 76 | (x,y) => x.Length == y.Length && x.All(it => y.Contains(it)), |
|
82 | 77 | x => x.Sum(it => x.GetHashCode()) |
|
83 | 78 | ); |
|
84 | 79 | return FinalStates.GroupBy(x => m_tags[x], arrayComparer).Select(g => new HashSet<int>(g)); |
|
85 | 80 | } |
|
86 | 81 | |
|
87 | 82 | } |
|
88 | 83 | } |
|
89 | 84 |
@@ -1,29 +1,25 | |||
|
1 | 1 | using System.Collections.Generic; |
|
2 | 2 | using System.Linq; |
|
3 | 3 | using Implab.Automaton; |
|
4 | 4 | |
|
5 | 5 | namespace Implab.Formats { |
|
6 | 6 | public class ByteAlphabet : IndexedAlphabetBase<byte> { |
|
7 |
public ByteAlphabet() |
|
|
7 | public ByteAlphabet() { | |
|
8 | 8 | } |
|
9 | 9 | |
|
10 | 10 | #region implemented abstract members of IndexedAlphabetBase |
|
11 | 11 | |
|
12 | 12 | public override int GetSymbolIndex(byte symbol) { |
|
13 | 13 | return (int)symbol; |
|
14 | 14 | } |
|
15 | 15 | |
|
16 | public override byte GetSymbolByIndex(int index) { | |
|
17 | return (byte)index; | |
|
18 | } | |
|
19 | ||
|
20 | 16 | public IEnumerable<byte> InputSymbols { |
|
21 | 17 | get { |
|
22 | 18 | return Enumerable.Range(byte.MinValue, byte.MaxValue).Cast<byte>(); |
|
23 | 19 | } |
|
24 | 20 | } |
|
25 | 21 | |
|
26 | 22 | #endregion |
|
27 | 23 | } |
|
28 | 24 | } |
|
29 | 25 |
@@ -1,24 +1,19 | |||
|
1 | 1 | using System.Collections.Generic; |
|
2 | 2 | using System.Linq; |
|
3 | 3 | using Implab.Automaton; |
|
4 | 4 | |
|
5 | 5 | namespace Implab.Formats { |
|
6 | 6 | public class CharAlphabet: IndexedAlphabetBase<char> { |
|
7 | 7 | |
|
8 | public CharAlphabet() | |
|
9 | : base(char.MaxValue + 1) { | |
|
8 | public CharAlphabet() { | |
|
10 | 9 | } |
|
11 | 10 | |
|
12 | 11 | public override int GetSymbolIndex(char symbol) { |
|
13 | 12 | return symbol; |
|
14 | 13 | } |
|
15 | 14 | |
|
16 |
public |
|
|
17 | return (char)index; | |
|
18 | } | |
|
19 | ||
|
20 | public override IEnumerable<char> InputSymbols { | |
|
15 | public IEnumerable<char> InputSymbols { | |
|
21 | 16 | get { return Enumerable.Range(char.MinValue, char.MaxValue).Cast<char>(); } |
|
22 | 17 | } |
|
23 | 18 | } |
|
24 | 19 | } |
@@ -1,116 +1,109 | |||
|
1 | 1 | using System.Linq; |
|
2 | 2 | using Implab.Automaton.RegularExpressions; |
|
3 | 3 | using System; |
|
4 | 4 | using Implab.Automaton; |
|
5 | 5 | |
|
6 | 6 | namespace Implab.Formats.JSON { |
|
7 | 7 | class JSONGrammar : Grammar<char,JSONGrammar.TokenType> { |
|
8 | 8 | public enum TokenType { |
|
9 | 9 | None, |
|
10 | 10 | BeginObject, |
|
11 | 11 | EndObject, |
|
12 | 12 | BeginArray, |
|
13 | 13 | EndArray, |
|
14 | 14 | String, |
|
15 | 15 | Number, |
|
16 | 16 | Literal, |
|
17 | 17 | NameSeparator, |
|
18 | 18 | ValueSeparator, |
|
19 | 19 | |
|
20 | 20 | StringBound, |
|
21 | 21 | EscapedChar, |
|
22 | 22 | UnescapedChar, |
|
23 |
EscapedUnicode |
|
|
24 | ||
|
25 | Minus, | |
|
26 | Plus, | |
|
27 | Sign, | |
|
28 | Integer, | |
|
29 | Dot, | |
|
30 | Exp | |
|
23 | EscapedUnicode | |
|
31 | 24 | } |
|
32 | 25 | |
|
33 | 26 | static Lazy<JSONGrammar> _instance = new Lazy<JSONGrammar>(); |
|
34 | 27 | |
|
35 | 28 | public static JSONGrammar Instance { |
|
36 | 29 | get { return _instance.Value; } |
|
37 | 30 | } |
|
38 | 31 | |
|
39 |
readonly |
|
|
40 |
readonly |
|
|
32 | readonly ScannerContext<TokenType> m_jsonDFA; | |
|
33 | readonly ScannerContext<TokenType> m_stringDFA; | |
|
41 | 34 | |
|
42 | 35 | public JSONGrammar() { |
|
43 | 36 | DefineAlphabet(Enumerable.Range(0, 0x20).Select(x => (char)x)); |
|
44 | 37 | var hexDigit = SymbolRangeToken('a','f').Or(SymbolRangeToken('A','F')).Or(SymbolRangeToken('0','9')); |
|
45 | 38 | var digit9 = SymbolRangeToken('1', '9'); |
|
46 | 39 | var zero = SymbolToken('0'); |
|
47 | 40 | var digit = zero.Or(digit9); |
|
48 | 41 | var dot = SymbolToken('.'); |
|
49 | 42 | var minus = SymbolToken('-'); |
|
50 | 43 | var sign = SymbolSetToken('-', '+'); |
|
51 | 44 | var expSign = SymbolSetToken('e', 'E'); |
|
52 | 45 | var letters = SymbolRangeToken('a', 'z'); |
|
53 | 46 | var integer = zero.Or(digit9.Cat(digit.EClosure())); |
|
54 | 47 | var frac = dot.Cat(digit.Closure()); |
|
55 | 48 | var exp = expSign.Cat(sign.Optional()).Cat(digit.Closure()); |
|
56 | 49 | var quote = SymbolToken('"'); |
|
57 | 50 | var backSlash = SymbolToken('\\'); |
|
58 | 51 | var specialEscapeChars = SymbolSetToken('\\', '"', '/', 'b', 'f', 't', 'n', 'r'); |
|
59 | 52 | var unicodeEspace = SymbolToken('u').Cat(hexDigit.Repeat(4)); |
|
60 | 53 | var whitespace = SymbolSetToken('\n', '\r', '\t', ' ').EClosure(); |
|
61 | 54 | var beginObject = whitespace.Cat(SymbolToken('{')).Cat(whitespace); |
|
62 | 55 | var endObject = whitespace.Cat(SymbolToken('}')).Cat(whitespace); |
|
63 | 56 | var beginArray = whitespace.Cat(SymbolToken('[')).Cat(whitespace); |
|
64 | 57 | var endArray = whitespace.Cat(SymbolToken(']')).Cat(whitespace); |
|
65 | 58 | var nameSep = whitespace.Cat(SymbolToken(':')).Cat(whitespace); |
|
66 | 59 | var valueSep = whitespace.Cat(SymbolToken(',')).Cat(whitespace); |
|
67 | 60 | |
|
68 | 61 | var number = minus.Optional().Cat(integer).Cat(frac.Optional()).Cat(exp.Optional()); |
|
69 | 62 | var literal = letters.Closure(); |
|
70 | 63 | var unescaped = SymbolTokenExcept(Enumerable.Range(0, 0x20).Union(new int[] { '\\', '"' }).Select(x => (char)x)); |
|
71 | 64 | |
|
72 | 65 | var jsonExpression = |
|
73 | 66 | number.Tag(TokenType.Number) |
|
74 | 67 | .Or(literal.Tag(TokenType.Literal)) |
|
75 | 68 | .Or(quote.Tag(TokenType.StringBound)) |
|
76 | 69 | .Or(beginObject.Tag(TokenType.BeginObject)) |
|
77 | 70 | .Or(endObject.Tag(TokenType.EndObject)) |
|
78 | 71 | .Or(beginArray.Tag(TokenType.BeginArray)) |
|
79 | 72 | .Or(endArray.Tag(TokenType.EndArray)) |
|
80 | 73 | .Or(nameSep.Tag(TokenType.NameSeparator)) |
|
81 | 74 | .Or(valueSep.Tag(TokenType.ValueSeparator)); |
|
82 | 75 | |
|
83 | 76 | |
|
84 | 77 | var jsonStringExpression = |
|
85 | 78 | quote.Tag(TokenType.StringBound) |
|
86 | 79 | .Or(backSlash.Cat(specialEscapeChars).Tag(TokenType.EscapedChar)) |
|
87 | 80 | .Or(backSlash.Cat(unicodeEspace).Tag(TokenType.EscapedUnicode)) |
|
88 | 81 | .Or(unescaped.Closure().Tag(TokenType.UnescapedChar)); |
|
89 | 82 | |
|
90 | 83 | |
|
91 |
m_jsonDFA = Build |
|
|
92 |
m_stringDFA = Build |
|
|
84 | m_jsonDFA = BuildScannerContext(jsonExpression); | |
|
85 | m_stringDFA = BuildScannerContext(jsonStringExpression); | |
|
93 | 86 | } |
|
94 | 87 | |
|
95 |
public |
|
|
88 | public ScannerContext<TokenType> JsonDFA { | |
|
96 | 89 | get { |
|
97 | 90 | return m_jsonDFA; |
|
98 | 91 | } |
|
99 | 92 | } |
|
100 | 93 | |
|
101 |
public |
|
|
94 | public ScannerContext<TokenType> JsonStringDFA { | |
|
102 | 95 | get { |
|
103 | 96 | return m_stringDFA; |
|
104 | 97 | } |
|
105 | 98 | } |
|
106 | 99 | |
|
107 | 100 | Token<TokenType> SymbolRangeToken(char start, char stop) { |
|
108 | 101 | return SymbolToken(Enumerable.Range(start,stop - start).Cast<char>()); |
|
109 | 102 | } |
|
110 | 103 | |
|
111 | 104 | protected override IAlphabetBuilder<char> CreateAlphabet() { |
|
112 | 105 | return new CharAlphabet(); |
|
113 | 106 | } |
|
114 | 107 | |
|
115 | 108 | } |
|
116 | 109 | } |
@@ -1,96 +1,101 | |||
|
1 | 1 | using System; |
|
2 | 2 | using System.Globalization; |
|
3 | 3 | using Implab.Automaton; |
|
4 | using System.Text; | |
|
5 | using Implab.Components; | |
|
6 | using System.IO; | |
|
7 | using Implab.Automaton.RegularExpressions; | |
|
4 | 8 | |
|
5 | 9 | namespace Implab.Formats.JSON { |
|
6 | 10 | /// <summary> |
|
7 | 11 | /// Сканнер (лексер), разбивающий поток символов на токены JSON. |
|
8 | 12 | /// </summary> |
|
9 |
public class JSONScanner : |
|
|
10 | char[] m_stringBuffer; | |
|
11 | DFAStateDescriptior<>[] m_stringDFA; | |
|
12 | int[] m_stringAlphabet; | |
|
13 | public class JSONScanner : Disposable { | |
|
14 | readonly StringBuilder m_builder = new StringBuilder(); | |
|
15 | ||
|
16 | readonly ScannerContext<JSONGrammar.TokenType> m_jsonScanner = JSONGrammar.Instance.JsonDFA; | |
|
17 | readonly ScannerContext<JSONGrammar.TokenType> m_stringScanner = JSONGrammar.Instance.JsonStringDFA; | |
|
18 | ||
|
19 | ||
|
20 | readonly TextScanner m_scanner; | |
|
13 | 21 | |
|
14 | 22 | /// <summary> |
|
15 | 23 | /// Создает новый экземпляр сканнера |
|
16 | 24 | /// </summary> |
|
17 | public JSONScanner() | |
|
18 | : base(JSONGrammar.Instance.JsonDFA.GetTransitionTable(), JSONGrammar.Instance.JsonDFA.Alphabet.GetTranslationMap()) { | |
|
19 | m_stringBuffer = new char[1024]; | |
|
20 | var dfa = JSONGrammar.Instance.JsonStringDFA; | |
|
21 | m_stringAlphabet = dfa.Alphabet.GetTranslationMap(); | |
|
22 | m_stringDFA = dfa.States; | |
|
25 | public JSONScanner(string text) { | |
|
26 | Safe.ArgumentNotEmpty(text, "text"); | |
|
27 | ||
|
28 | m_scanner = new StringScanner(text); | |
|
29 | } | |
|
30 | ||
|
31 | public JSONScanner(TextReader reader, int bufferMax, int chunkSize) { | |
|
32 | Safe.ArgumentNotNull(reader, "reader"); | |
|
33 | ||
|
34 | m_scanner = new ReaderScanner(reader); | |
|
23 | 35 | } |
|
24 | 36 | |
|
25 | 37 | /// <summary> |
|
26 | 38 | /// Читает следующий лексический элемент из входных данных. |
|
27 | 39 | /// </summary> |
|
28 | 40 | /// <param name="tokenValue">Возвращает значение прочитанного токена.</param> |
|
29 | 41 | /// <param name="tokenType">Возвращает тип прочитанного токена.</param> |
|
30 | 42 | /// <returns><c>true</c> - чтение произведено успешно. <c>false</c> - достигнут конец входных данных</returns> |
|
31 | 43 | /// <remarks>В случе если токен не распознается, возникает исключение. Значения токенов обрабатываются, т.е. |
|
32 | 44 | /// в строках обрабатываются экранированные символы, числа становтся типа double.</remarks> |
|
33 | 45 | public bool ReadToken(out object tokenValue, out JsonTokenType tokenType) { |
|
34 | if (ReadTokenInternal()) { | |
|
35 | switch ((JSONGrammar.TokenType)m_currentState.tag[0]) { | |
|
46 | JSONGrammar.TokenType[] tag; | |
|
47 | if (m_jsonScanner.Execute(m_scanner, out tag)) { | |
|
48 | switch (tag[0]) { | |
|
36 | 49 | case JSONGrammar.TokenType.StringBound: |
|
37 | 50 | tokenValue = ReadString(); |
|
38 | 51 | tokenType = JsonTokenType.String; |
|
39 | 52 | break; |
|
40 | 53 | case JSONGrammar.TokenType.Number: |
|
41 |
tokenValue = Double.Parse( |
|
|
54 | tokenValue = Double.Parse(m_scanner.GetTokenValue(), CultureInfo.InvariantCulture); | |
|
42 | 55 | tokenType = JsonTokenType.Number; |
|
43 | 56 | break; |
|
44 | 57 | default: |
|
45 |
tokenType = (JsonTokenType) |
|
|
46 |
tokenValue = |
|
|
58 | tokenType = (JsonTokenType)tag[0]; | |
|
59 | tokenValue = m_scanner.GetTokenValue(); | |
|
47 | 60 | break; |
|
48 | 61 | } |
|
49 | 62 | return true; |
|
50 | 63 | } |
|
51 | 64 | tokenValue = null; |
|
52 | 65 | tokenType = JsonTokenType.None; |
|
53 | 66 | return false; |
|
54 | 67 | } |
|
55 | 68 | |
|
56 | 69 | string ReadString() { |
|
57 | 70 | int pos = 0; |
|
58 | Switch(m_stringDFA, m_stringAlphabet); | |
|
59 | while (ReadTokenInternal()) { | |
|
60 |
|
|
|
71 | char[] buf = new char[6]; // the buffer for unescaping chars | |
|
72 | ||
|
73 | JSONGrammar.TokenType[] tag; | |
|
74 | m_builder.Clear(); | |
|
75 | ||
|
76 | while (m_stringScanner.Execute(m_scanner, out tag)) { | |
|
77 | switch (tag[0]) { | |
|
61 | 78 | case JSONGrammar.TokenType.StringBound: |
|
62 |
|
|
|
63 | return new String(m_stringBuffer, 0, pos); | |
|
79 | return m_builder.ToString(); | |
|
64 | 80 | case JSONGrammar.TokenType.UnescapedChar: |
|
65 | EnsureStringBufferSize(pos + m_tokenLen); | |
|
66 | Array.Copy(m_buffer, m_tokenOffset, m_stringBuffer, pos, m_tokenLen); | |
|
67 | pos += m_tokenLen; | |
|
81 | m_scanner.CopyTokenTo(m_builder); | |
|
68 | 82 | break; |
|
69 | case JSONGrammar.TokenType.EscapedUnicode: | |
|
70 | EnsureStringBufferSize(pos + 1); | |
|
71 |
m_ |
|
|
83 | case JSONGrammar.TokenType.EscapedUnicode: // \xXXXX - unicode escape sequence | |
|
84 | m_scanner.CopyTokenTo(buf, 0); | |
|
85 | m_builder.Append(StringTranslator.TranslateHexUnicode(buf, 2)); | |
|
72 | 86 | pos++; |
|
73 | 87 | break; |
|
74 | case JSONGrammar.TokenType.EscapedChar: | |
|
75 |
|
|
|
76 |
m_ |
|
|
77 | pos++; | |
|
88 | case JSONGrammar.TokenType.EscapedChar: // \t - escape sequence | |
|
89 | m_scanner.CopyTokenTo(buf, 0); | |
|
90 | m_builder.Append(StringTranslator.TranslateEscapedChar(buf[1])); | |
|
78 | 91 | break; |
|
79 | 92 | default: |
|
80 | 93 | break; |
|
81 | 94 | } |
|
82 | 95 | |
|
83 | 96 | } |
|
84 | 97 | |
|
85 | 98 | throw new ParserException("Unexpected end of data"); |
|
86 | 99 | } |
|
87 | ||
|
88 | void EnsureStringBufferSize(int size) { | |
|
89 | if (size > m_stringBuffer.Length) { | |
|
90 | var newBuffer = new char[size]; | |
|
91 | m_stringBuffer.CopyTo(newBuffer, 0); | |
|
92 | m_stringBuffer = newBuffer; | |
|
93 | 100 | } |
|
94 | 101 | } |
|
95 | } | |
|
96 | } |
@@ -1,96 +1,95 | |||
|
1 | 1 | using Implab; |
|
2 |
using Implab. |
|
|
2 | using Implab.Formats; | |
|
3 | 3 | using System; |
|
4 | 4 | using System.Collections.Generic; |
|
5 | 5 | using System.Diagnostics; |
|
6 | 6 | using System.Linq; |
|
7 | 7 | using System.Text; |
|
8 | 8 | using System.Threading.Tasks; |
|
9 | 9 | |
|
10 | namespace Implab.JSON { | |
|
10 | namespace Implab.Formats.JSON { | |
|
11 | 11 | /// <summary> |
|
12 | 12 | /// Класс для преобразования экранированной строки JSON |
|
13 | 13 | /// </summary> |
|
14 | public class StringTranslator : Scanner { | |
|
14 | public class StringTranslator : TextScanner<JSONGrammar.TokenType> { | |
|
15 | 15 | static readonly char[] _escMap; |
|
16 | 16 | static readonly int[] _hexMap; |
|
17 | 17 | |
|
18 | 18 | static StringTranslator() { |
|
19 | 19 | var chars = new char[] { 'b', 'f', 't', 'r', 'n', '\\', '/' }; |
|
20 | 20 | var vals = new char[] { '\b', '\f', '\t', '\r', '\n', '\\', '/' }; |
|
21 | 21 | |
|
22 | 22 | _escMap = new char[chars.Max() + 1]; |
|
23 | 23 | |
|
24 | 24 | for (int i = 0; i < chars.Length; i++) |
|
25 | 25 | _escMap[chars[i]] = vals[i]; |
|
26 | 26 | |
|
27 | 27 | var hexs = new char[] { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'a', 'b', 'c', 'd', 'e', 'f', 'A', 'B', 'C', 'D', 'E', 'F' }; |
|
28 | 28 | var ints = new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 10, 11, 12, 13, 14, 15 }; |
|
29 | 29 | |
|
30 | 30 | _hexMap = new int[hexs.Max() + 1]; |
|
31 | 31 | |
|
32 | 32 | for (int i = 0; i < hexs.Length; i++) |
|
33 | 33 | _hexMap[hexs[i]] = ints[i]; |
|
34 | 34 | |
|
35 | 35 | } |
|
36 | 36 | |
|
37 | public StringTranslator() | |
|
38 | : base(JSONGrammar.Instance.JsonStringDFA.States, JSONGrammar.Instance.JsonStringDFA.Alphabet.GetTranslationMap()) { | |
|
37 | public StringTranslator() { | |
|
39 | 38 | } |
|
40 | 39 | |
|
41 | 40 | public string Translate(string data) { |
|
42 | 41 | Safe.ArgumentNotNull(data, "data"); |
|
43 | 42 | return Translate(data.ToCharArray()); |
|
44 | 43 | } |
|
45 | 44 | |
|
46 | 45 | public string Translate(char[] data) { |
|
47 | 46 | Safe.ArgumentNotNull(data, "data"); |
|
48 | 47 | return Translate(data, data.Length); |
|
49 | 48 | } |
|
50 | 49 | |
|
51 | 50 | public string Translate(char[] data, int length) { |
|
52 | 51 | Safe.ArgumentNotNull(data, "data"); |
|
53 | 52 | Safe.ArgumentInRange(length, 0, data.Length, "length"); |
|
54 | 53 | |
|
55 | 54 | var translated = new char[length]; |
|
56 | 55 | |
|
57 | 56 | Feed(data,length); |
|
58 | 57 | |
|
59 | 58 | int pos = 0; |
|
60 | 59 | |
|
61 | 60 | while (ReadTokenInternal()) { |
|
62 |
switch ((JSONGrammar.TokenType) |
|
|
61 | switch ((JSONGrammar.TokenType)Tags[0]) { | |
|
63 | 62 | case JSONGrammar.TokenType.UnescapedChar: |
|
64 | 63 | Array.Copy(m_buffer,m_tokenOffset,translated,pos,m_tokenLen); |
|
65 | 64 | pos += m_tokenLen; |
|
66 | 65 | break; |
|
67 | 66 | case JSONGrammar.TokenType.EscapedChar: |
|
68 | 67 | translated[pos] = _escMap[m_buffer[m_tokenOffset + 1]]; |
|
69 | 68 | pos++; |
|
70 | 69 | break; |
|
71 | 70 | case JSONGrammar.TokenType.EscapedUnicode: |
|
72 | 71 | translated[pos] = TranslateHexUnicode(m_buffer,m_tokenOffset + 2); |
|
73 | 72 | pos++; |
|
74 | 73 | break; |
|
75 | 74 | } |
|
76 | 75 | } |
|
77 | 76 | |
|
78 | 77 | return new String(translated, 0, pos); |
|
79 | 78 | } |
|
80 | 79 | |
|
81 | 80 | internal static char TranslateEscapedChar(char symbol) { |
|
82 | 81 | return _escMap[symbol]; |
|
83 | 82 | } |
|
84 | 83 | |
|
85 | 84 | internal static char TranslateHexUnicode(char[] symbols, int offset) { |
|
86 | 85 | Debug.Assert(symbols != null); |
|
87 | 86 | Debug.Assert(symbols.Length - offset >= 4); |
|
88 | 87 | |
|
89 | 88 | int value = (_hexMap[symbols[offset]] << 12) |
|
90 | 89 | | (_hexMap[symbols[offset + 1]] << 8) |
|
91 | 90 | | (_hexMap[symbols[offset + 2]] << 4) |
|
92 | 91 | | (_hexMap[symbols[offset + 3]]); |
|
93 | 92 | return (char)value; |
|
94 | 93 | } |
|
95 | 94 | } |
|
96 | 95 | } |
@@ -1,53 +1,149 | |||
|
1 | 1 | using System; |
|
2 | 2 | using Implab.Components; |
|
3 | 3 | using Implab.Automaton.RegularExpressions; |
|
4 | 4 | using System.Diagnostics; |
|
5 | 5 | using Implab.Automaton; |
|
6 | using System.IO; | |
|
7 | using System.Text; | |
|
6 | 8 | |
|
7 | 9 | namespace Implab.Formats { |
|
8 |
public abstract class TextScanner |
|
|
10 | public abstract class TextScanner : Disposable { | |
|
11 | readonly int m_bufferMax; | |
|
12 | readonly int m_chunkSize; | |
|
9 | 13 | |
|
10 | int m_maxSymbol; | |
|
11 | int[] m_symbolMap; | |
|
12 | ||
|
13 | readonly char[] m_buffer; | |
|
14 | char[] m_buffer; | |
|
14 | 15 | int m_bufferOffset; |
|
15 | 16 | int m_bufferSize; |
|
17 | int m_tokenOffset; | |
|
16 | 18 | int m_tokenLength; |
|
17 | 19 | |
|
18 | TTag[] m_tags; | |
|
20 | /// <summary> | |
|
21 | /// Initializes a new instance of the <see cref="Implab.Formats.TextScanner`1"/> class. | |
|
22 | /// </summary> | |
|
23 | /// <param name="bufferMax">Buffer max.</param> | |
|
24 | /// <param name="chunkSize">Chunk size.</param> | |
|
25 | protected TextScanner(int bufferMax, int chunkSize) { | |
|
26 | Debug.Assert(m_chunkSize <= m_bufferMax); | |
|
27 | ||
|
28 | m_bufferMax = bufferMax; | |
|
29 | m_chunkSize = chunkSize; | |
|
30 | } | |
|
19 | 31 | |
|
20 | protected bool ReadTokenInternal(DFAStateDescriptor<TTag>[] dfa, int state) { | |
|
21 | Debug.Assert(dfa != null); | |
|
32 | /// <summary> | |
|
33 | /// Initializes a new instance of the <see cref="Implab.Formats.TextScanner`1"/> class. | |
|
34 | /// </summary> | |
|
35 | /// <param name="buffer">Buffer.</param> | |
|
36 | protected TextScanner(char[] buffer) { | |
|
37 | if (buffer != null) { | |
|
38 | m_buffer = buffer; | |
|
39 | m_bufferSize = buffer.Length; | |
|
40 | } | |
|
41 | } | |
|
42 | ||
|
43 | /// <summary> | |
|
44 | /// (hungry) Reads the next token. | |
|
45 | /// </summary> | |
|
46 | /// <returns><c>true</c>, if token internal was read, <c>false</c> if there is no more tokens in the stream.</returns> | |
|
47 | /// <param name="dfa">The transition map for the automaton</param> | |
|
48 | /// <param name="final">Final states of the automaton.</param> | |
|
49 | /// <param name="tags">Tags.</param> | |
|
50 | /// <param name="state">The initial state for the automaton.</param> | |
|
51 | internal bool ReadToken<TTag>(int[,] dfa, int[] final, TTag[][] tags, int state, int[] alphabet, out TTag[] tag) { | |
|
52 | Safe.ArgumentNotNull(); | |
|
53 | m_tokenLength = 0; | |
|
54 | ||
|
55 | var maxSymbol = alphabet.Length - 1; | |
|
22 | 56 | |
|
23 | 57 | do { |
|
24 | for (var pos = m_bufferOffset; pos < m_bufferSize; pos++) { | |
|
58 | // after the next chunk is read the offset in the buffer may change | |
|
59 | int pos = m_bufferOffset + m_tokenLength; | |
|
60 | ||
|
61 | while(pos < m_bufferSize) { | |
|
25 | 62 | var ch = m_buffer[pos]; |
|
26 | state = dfa[state].transitions[m_symbolMap[ch > m_maxSymbol ? m_maxSymbol : ch]]; | |
|
63 | ||
|
64 | state = dfa[state,ch > maxSymbol ? DFAConst.UNCLASSIFIED_INPUT : alphabet[ch]]; | |
|
27 | 65 | if (state == DFAConst.UNREACHABLE_STATE) |
|
28 | 66 | break; |
|
67 | ||
|
68 | pos++; | |
|
29 | 69 | } |
|
30 | } while (Feed()); | |
|
70 | ||
|
71 | m_tokenLength = pos - m_bufferOffset; | |
|
72 | } while (state != DFAConst.UNREACHABLE_STATE && Feed()); | |
|
73 | ||
|
74 | m_tokenOffset = m_bufferOffset; | |
|
75 | m_bufferOffset += m_tokenLength; | |
|
31 | 76 | |
|
32 |
if ( |
|
|
77 | if (final[state]) { | |
|
78 | tag = tags[state]; | |
|
79 | return true; | |
|
80 | } else { | |
|
81 | if (m_bufferOffset == m_bufferSize) { | |
|
82 | if (m_tokenLength == 0) //EOF | |
|
83 | return false; | |
|
84 | ||
|
85 | throw new ParserException(); | |
|
86 | } | |
|
87 | throw new ParserException(String.Format("Unexpected symbol '{0}'", m_buffer[m_bufferOffset])); | |
|
33 | 88 | |
|
34 | 89 | } |
|
90 | } | |
|
35 | 91 | |
|
92 | protected void Feed(char[] buffer, int offset, int length) { | |
|
93 | m_buffer = buffer; | |
|
94 | m_bufferOffset = offset; | |
|
95 | m_bufferSize = offset + length; | |
|
36 | 96 | } |
|
37 | 97 | |
|
38 | bool Feed() { | |
|
98 | protected bool Feed() { | |
|
99 | if (m_chunkSize <= 0) | |
|
100 | return false; | |
|
101 | ||
|
102 | if (m_buffer != null) { | |
|
103 | var free = m_buffer.Length - m_bufferSize; | |
|
104 | ||
|
105 | if (free < m_chunkSize) { | |
|
106 | free += m_chunkSize; | |
|
107 | var used = m_bufferSize - m_bufferOffset; | |
|
108 | var size = used + free; | |
|
109 | ||
|
110 | if (size > m_bufferMax) | |
|
111 | throw new ParserException(String.Format("The buffer limit ({0} Kb) is reached"), m_bufferMax/1024); | |
|
112 | ||
|
113 | var temp = new char[size]; | |
|
39 | 114 | |
|
115 | var read = Read(temp, used, m_chunkSize); | |
|
116 | if (read == 0) | |
|
117 | return false; | |
|
118 | ||
|
119 | Array.Copy(m_buffer, m_bufferOffset, temp, 0, used); | |
|
120 | ||
|
121 | m_bufferOffset = 0; | |
|
122 | m_bufferSize = used + read; | |
|
123 | m_buffer = temp; | |
|
124 | } | |
|
125 | } else { | |
|
126 | Debug.Assert(m_bufferOffset == 0); | |
|
127 | m_buffer = new char[m_chunkSize]; | |
|
128 | m_bufferSize = Read(m_buffer, 0, m_chunkSize); | |
|
129 | return (m_bufferSize != 0); | |
|
130 | } | |
|
40 | 131 | } |
|
41 | 132 | |
|
42 | 133 | protected abstract int Read(char[] buffer, int offset, int size); |
|
43 | 134 | |
|
44 | protected TTag[] Tags { | |
|
45 | get { | |
|
46 | return m_tags; | |
|
47 | } | |
|
135 | public string GetTokenValue() { | |
|
136 | return new String(m_buffer, m_tokenOffset, m_tokenLength); | |
|
48 | 137 | } |
|
49 | 138 | |
|
139 | public void CopyTokenTo(char[] buffer, int offset) { | |
|
140 | m_buffer.CopyTo(buffer, offset); | |
|
141 | } | |
|
142 | ||
|
143 | public void CopyTokenTo(StringBuilder sb) { | |
|
144 | sb.Append(m_buffer, m_tokenOffset, m_tokenLength); | |
|
145 | } | |
|
50 | 146 | |
|
51 | 147 | } |
|
52 | 148 | } |
|
53 | 149 |
@@ -1,274 +1,273 | |||
|
1 | 1 | <?xml version="1.0" encoding="utf-8"?> |
|
2 | 2 | <Project DefaultTargets="Build" ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003"> |
|
3 | 3 | <PropertyGroup> |
|
4 | 4 | <Configuration Condition=" '$(Configuration)' == '' ">Debug</Configuration> |
|
5 | 5 | <Platform Condition=" '$(Platform)' == '' ">AnyCPU</Platform> |
|
6 | 6 | <ProjectGuid>{F550F1F8-8746-4AD0-9614-855F4C4B7F05}</ProjectGuid> |
|
7 | 7 | <OutputType>Library</OutputType> |
|
8 | 8 | <RootNamespace>Implab</RootNamespace> |
|
9 | 9 | <AssemblyName>Implab</AssemblyName> |
|
10 | 10 | <TargetFrameworkVersion>v4.5</TargetFrameworkVersion> |
|
11 | 11 | <ReleaseVersion>0.2</ReleaseVersion> |
|
12 | 12 | <ProductVersion>8.0.30703</ProductVersion> |
|
13 | 13 | <SchemaVersion>2.0</SchemaVersion> |
|
14 | 14 | </PropertyGroup> |
|
15 | 15 | <PropertyGroup Condition=" '$(Configuration)|$(Platform)' == 'Debug|AnyCPU' "> |
|
16 | 16 | <DebugSymbols>true</DebugSymbols> |
|
17 | 17 | <DebugType>full</DebugType> |
|
18 | 18 | <Optimize>false</Optimize> |
|
19 | 19 | <OutputPath>bin\Debug</OutputPath> |
|
20 | 20 | <DefineConstants>TRACE;DEBUG;</DefineConstants> |
|
21 | 21 | <ErrorReport>prompt</ErrorReport> |
|
22 | 22 | <WarningLevel>4</WarningLevel> |
|
23 | 23 | <ConsolePause>false</ConsolePause> |
|
24 | 24 | <RunCodeAnalysis>true</RunCodeAnalysis> |
|
25 | 25 | </PropertyGroup> |
|
26 | 26 | <PropertyGroup Condition=" '$(Configuration)|$(Platform)' == 'Release|AnyCPU' "> |
|
27 | 27 | <DebugType>full</DebugType> |
|
28 | 28 | <Optimize>true</Optimize> |
|
29 | 29 | <OutputPath>bin\Release</OutputPath> |
|
30 | 30 | <ErrorReport>prompt</ErrorReport> |
|
31 | 31 | <WarningLevel>4</WarningLevel> |
|
32 | 32 | <ConsolePause>false</ConsolePause> |
|
33 | 33 | </PropertyGroup> |
|
34 | 34 | <PropertyGroup Condition=" '$(Configuration)|$(Platform)' == 'Debug 4.5|AnyCPU' "> |
|
35 | 35 | <DebugSymbols>true</DebugSymbols> |
|
36 | 36 | <DebugType>full</DebugType> |
|
37 | 37 | <Optimize>false</Optimize> |
|
38 | 38 | <OutputPath>bin\Debug</OutputPath> |
|
39 | 39 | <DefineConstants>TRACE;DEBUG;NET_4_5</DefineConstants> |
|
40 | 40 | <ErrorReport>prompt</ErrorReport> |
|
41 | 41 | <WarningLevel>4</WarningLevel> |
|
42 | 42 | <RunCodeAnalysis>true</RunCodeAnalysis> |
|
43 | 43 | <ConsolePause>false</ConsolePause> |
|
44 | 44 | </PropertyGroup> |
|
45 | 45 | <PropertyGroup Condition=" '$(Configuration)|$(Platform)' == 'Release 4.5|AnyCPU' "> |
|
46 | 46 | <Optimize>true</Optimize> |
|
47 | 47 | <OutputPath>bin\Release</OutputPath> |
|
48 | 48 | <ErrorReport>prompt</ErrorReport> |
|
49 | 49 | <WarningLevel>4</WarningLevel> |
|
50 | 50 | <ConsolePause>false</ConsolePause> |
|
51 | 51 | <DefineConstants>NET_4_5</DefineConstants> |
|
52 | 52 | </PropertyGroup> |
|
53 | 53 | <PropertyGroup Condition=" '$(Configuration)|$(Platform)' == 'DebugMono|AnyCPU' "> |
|
54 | 54 | <DebugSymbols>true</DebugSymbols> |
|
55 | 55 | <DebugType>full</DebugType> |
|
56 | 56 | <Optimize>false</Optimize> |
|
57 | 57 | <OutputPath>bin\Debug</OutputPath> |
|
58 | 58 | <DefineConstants>TRACE;DEBUG;NET_4_5;MONO</DefineConstants> |
|
59 | 59 | <ErrorReport>prompt</ErrorReport> |
|
60 | 60 | <WarningLevel>4</WarningLevel> |
|
61 | 61 | <RunCodeAnalysis>true</RunCodeAnalysis> |
|
62 | 62 | <ConsolePause>false</ConsolePause> |
|
63 | 63 | </PropertyGroup> |
|
64 | 64 | <PropertyGroup Condition=" '$(Configuration)|$(Platform)' == 'ReleaseMono|AnyCPU' "> |
|
65 | 65 | <Optimize>true</Optimize> |
|
66 | 66 | <OutputPath>bin\Release</OutputPath> |
|
67 | 67 | <DefineConstants>NET_4_5;MONO;</DefineConstants> |
|
68 | 68 | <ErrorReport>prompt</ErrorReport> |
|
69 | 69 | <WarningLevel>4</WarningLevel> |
|
70 | 70 | <ConsolePause>false</ConsolePause> |
|
71 | 71 | </PropertyGroup> |
|
72 | 72 | <ItemGroup> |
|
73 | 73 | <Reference Include="System" /> |
|
74 | 74 | <Reference Include="System.Xml" /> |
|
75 | 75 | <Reference Include="mscorlib" /> |
|
76 | 76 | </ItemGroup> |
|
77 | 77 | <ItemGroup> |
|
78 | 78 | <Compile Include="CustomEqualityComparer.cs" /> |
|
79 | 79 | <Compile Include="Diagnostics\ConsoleTraceListener.cs" /> |
|
80 | 80 | <Compile Include="Diagnostics\EventText.cs" /> |
|
81 | 81 | <Compile Include="Diagnostics\LogChannel.cs" /> |
|
82 | 82 | <Compile Include="Diagnostics\LogicalOperation.cs" /> |
|
83 | 83 | <Compile Include="Diagnostics\TextFileListener.cs" /> |
|
84 | 84 | <Compile Include="Diagnostics\TraceLog.cs" /> |
|
85 | 85 | <Compile Include="Diagnostics\TraceEvent.cs" /> |
|
86 | 86 | <Compile Include="Diagnostics\TraceEventType.cs" /> |
|
87 | 87 | <Compile Include="ICancellable.cs" /> |
|
88 | 88 | <Compile Include="IProgressHandler.cs" /> |
|
89 | 89 | <Compile Include="IProgressNotifier.cs" /> |
|
90 | 90 | <Compile Include="IPromiseT.cs" /> |
|
91 | 91 | <Compile Include="IPromise.cs" /> |
|
92 | 92 | <Compile Include="IServiceLocator.cs" /> |
|
93 | 93 | <Compile Include="ITaskController.cs" /> |
|
94 | 94 | <Compile Include="Parallels\DispatchPool.cs" /> |
|
95 | 95 | <Compile Include="Parallels\ArrayTraits.cs" /> |
|
96 | 96 | <Compile Include="Parallels\MTQueue.cs" /> |
|
97 | 97 | <Compile Include="Parallels\WorkerPool.cs" /> |
|
98 | 98 | <Compile Include="ProgressInitEventArgs.cs" /> |
|
99 | 99 | <Compile Include="Properties\AssemblyInfo.cs" /> |
|
100 | 100 | <Compile Include="Parallels\AsyncPool.cs" /> |
|
101 | 101 | <Compile Include="Safe.cs" /> |
|
102 | 102 | <Compile Include="ValueEventArgs.cs" /> |
|
103 | 103 | <Compile Include="PromiseExtensions.cs" /> |
|
104 | 104 | <Compile Include="SyncContextPromise.cs" /> |
|
105 | 105 | <Compile Include="Diagnostics\OperationContext.cs" /> |
|
106 | 106 | <Compile Include="Diagnostics\TraceContext.cs" /> |
|
107 | 107 | <Compile Include="Diagnostics\LogEventArgs.cs" /> |
|
108 | 108 | <Compile Include="Diagnostics\LogEventArgsT.cs" /> |
|
109 | 109 | <Compile Include="Diagnostics\Extensions.cs" /> |
|
110 | 110 | <Compile Include="PromiseEventType.cs" /> |
|
111 | 111 | <Compile Include="Parallels\AsyncQueue.cs" /> |
|
112 | 112 | <Compile Include="PromiseT.cs" /> |
|
113 | 113 | <Compile Include="IDeferred.cs" /> |
|
114 | 114 | <Compile Include="IDeferredT.cs" /> |
|
115 | 115 | <Compile Include="Promise.cs" /> |
|
116 | 116 | <Compile Include="PromiseTransientException.cs" /> |
|
117 | 117 | <Compile Include="Parallels\Signal.cs" /> |
|
118 | 118 | <Compile Include="Parallels\SharedLock.cs" /> |
|
119 | 119 | <Compile Include="Diagnostics\ILogWriter.cs" /> |
|
120 | 120 | <Compile Include="Diagnostics\ListenerBase.cs" /> |
|
121 | 121 | <Compile Include="Parallels\BlockingQueue.cs" /> |
|
122 | 122 | <Compile Include="AbstractEvent.cs" /> |
|
123 | 123 | <Compile Include="AbstractPromise.cs" /> |
|
124 | 124 | <Compile Include="AbstractPromiseT.cs" /> |
|
125 | 125 | <Compile Include="FuncTask.cs" /> |
|
126 | 126 | <Compile Include="FuncTaskBase.cs" /> |
|
127 | 127 | <Compile Include="FuncTaskT.cs" /> |
|
128 | 128 | <Compile Include="ActionChainTaskBase.cs" /> |
|
129 | 129 | <Compile Include="ActionChainTask.cs" /> |
|
130 | 130 | <Compile Include="ActionChainTaskT.cs" /> |
|
131 | 131 | <Compile Include="FuncChainTaskBase.cs" /> |
|
132 | 132 | <Compile Include="FuncChainTask.cs" /> |
|
133 | 133 | <Compile Include="FuncChainTaskT.cs" /> |
|
134 | 134 | <Compile Include="ActionTaskBase.cs" /> |
|
135 | 135 | <Compile Include="ActionTask.cs" /> |
|
136 | 136 | <Compile Include="ActionTaskT.cs" /> |
|
137 | 137 | <Compile Include="ICancellationToken.cs" /> |
|
138 | 138 | <Compile Include="SuccessPromise.cs" /> |
|
139 | 139 | <Compile Include="SuccessPromiseT.cs" /> |
|
140 | 140 | <Compile Include="PromiseAwaiterT.cs" /> |
|
141 | 141 | <Compile Include="PromiseAwaiter.cs" /> |
|
142 | 142 | <Compile Include="Components\ComponentContainer.cs" /> |
|
143 | 143 | <Compile Include="Components\Disposable.cs" /> |
|
144 | 144 | <Compile Include="Components\DisposablePool.cs" /> |
|
145 | 145 | <Compile Include="Components\ObjectPool.cs" /> |
|
146 | 146 | <Compile Include="Components\ServiceLocator.cs" /> |
|
147 | 147 | <Compile Include="Components\IInitializable.cs" /> |
|
148 | 148 | <Compile Include="TaskController.cs" /> |
|
149 | 149 | <Compile Include="Components\App.cs" /> |
|
150 | 150 | <Compile Include="Components\IRunnable.cs" /> |
|
151 | 151 | <Compile Include="Components\ExecutionState.cs" /> |
|
152 | 152 | <Compile Include="Components\RunnableComponent.cs" /> |
|
153 | 153 | <Compile Include="Components\IFactory.cs" /> |
|
154 | <Compile Include="Automaton\DFAStateDescriptor.cs" /> | |
|
155 | 154 | <Compile Include="Automaton\EnumAlphabet.cs" /> |
|
156 | 155 | <Compile Include="Automaton\IAlphabet.cs" /> |
|
157 | 156 | <Compile Include="Automaton\ParserException.cs" /> |
|
158 | <Compile Include="Automaton\Scanner.cs" /> | |
|
159 | 157 | <Compile Include="Automaton\IndexedAlphabetBase.cs" /> |
|
160 | 158 | <Compile Include="Automaton\IAlphabetBuilder.cs" /> |
|
161 | 159 | <Compile Include="Automaton\RegularExpressions\AltToken.cs" /> |
|
162 | 160 | <Compile Include="Automaton\RegularExpressions\BinaryToken.cs" /> |
|
163 | 161 | <Compile Include="Automaton\RegularExpressions\CatToken.cs" /> |
|
164 | 162 | <Compile Include="Automaton\DFAConst.cs" /> |
|
165 | 163 | <Compile Include="Automaton\RegularExpressions\Grammar.cs" /> |
|
166 | 164 | <Compile Include="Automaton\RegularExpressions\StarToken.cs" /> |
|
167 | 165 | <Compile Include="Automaton\RegularExpressions\SymbolToken.cs" /> |
|
168 | 166 | <Compile Include="Automaton\RegularExpressions\EmptyToken.cs" /> |
|
169 | 167 | <Compile Include="Automaton\RegularExpressions\EndToken.cs" /> |
|
170 | 168 | <Compile Include="Automaton\RegularExpressions\Token.cs" /> |
|
171 | 169 | <Compile Include="Automaton\RegularExpressions\IVisitor.cs" /> |
|
172 | 170 | <Compile Include="Automaton\AutomatonTransition.cs" /> |
|
173 | 171 | <Compile Include="Formats\JSON\JSONElementContext.cs" /> |
|
174 | 172 | <Compile Include="Formats\JSON\JSONElementType.cs" /> |
|
175 | 173 | <Compile Include="Formats\JSON\JSONGrammar.cs" /> |
|
176 | 174 | <Compile Include="Formats\JSON\JSONParser.cs" /> |
|
177 | 175 | <Compile Include="Formats\JSON\JSONScanner.cs" /> |
|
178 | 176 | <Compile Include="Formats\JSON\JsonTokenType.cs" /> |
|
179 | 177 | <Compile Include="Formats\JSON\JSONWriter.cs" /> |
|
180 | 178 | <Compile Include="Formats\JSON\JSONXmlReader.cs" /> |
|
181 | 179 | <Compile Include="Formats\JSON\JSONXmlReaderOptions.cs" /> |
|
182 | 180 | <Compile Include="Formats\JSON\StringTranslator.cs" /> |
|
183 | 181 | <Compile Include="Automaton\MapAlphabet.cs" /> |
|
184 | 182 | <Compile Include="Automaton\DummyAlphabet.cs" /> |
|
185 | 183 | <Compile Include="Formats\CharAlphabet.cs" /> |
|
186 | 184 | <Compile Include="Formats\ByteAlphabet.cs" /> |
|
187 | 185 | <Compile Include="Automaton\IDFATable.cs" /> |
|
188 | 186 | <Compile Include="Automaton\IDFATableBuilder.cs" /> |
|
189 | 187 | <Compile Include="Automaton\DFATable.cs" /> |
|
190 | 188 | <Compile Include="Automaton\RegularExpressions\RegularDFA.cs" /> |
|
191 | 189 | <Compile Include="Automaton\RegularExpressions\RegularExpressionVisitor.cs" /> |
|
192 | 190 | <Compile Include="Automaton\RegularExpressions\ITaggedDFABuilder.cs" /> |
|
193 | <Compile Include="Automaton\RegularExpressions\DFAStateDescriptorT.cs" /> | |
|
194 | <Compile Include="Formats\BufferScanner.cs" /> | |
|
195 | 191 | <Compile Include="Formats\TextScanner.cs" /> |
|
192 | <Compile Include="Formats\StringScanner.cs" /> | |
|
193 | <Compile Include="Formats\ReaderScanner.cs" /> | |
|
194 | <Compile Include="Formats\ScannerContext.cs" /> | |
|
196 | 195 | </ItemGroup> |
|
197 | 196 | <Import Project="$(MSBuildBinPath)\Microsoft.CSharp.targets" /> |
|
198 | 197 | <ItemGroup /> |
|
199 | 198 | <ProjectExtensions> |
|
200 | 199 | <MonoDevelop> |
|
201 | 200 | <Properties> |
|
202 | 201 | <Policies> |
|
203 | 202 | <CSharpFormattingPolicy IndentSwitchBody="True" NamespaceBraceStyle="EndOfLine" ClassBraceStyle="EndOfLine" InterfaceBraceStyle="EndOfLine" StructBraceStyle="EndOfLine" EnumBraceStyle="EndOfLine" MethodBraceStyle="EndOfLine" ConstructorBraceStyle="EndOfLine" DestructorBraceStyle="EndOfLine" BeforeMethodDeclarationParentheses="False" BeforeMethodCallParentheses="False" BeforeConstructorDeclarationParentheses="False" NewLineBeforeConstructorInitializerColon="NewLine" NewLineAfterConstructorInitializerColon="SameLine" BeforeIndexerDeclarationBracket="False" BeforeDelegateDeclarationParentheses="False" NewParentheses="False" SpacesBeforeBrackets="False" inheritsSet="Mono" inheritsScope="text/x-csharp" scope="text/x-csharp" /> |
|
204 | 203 | <TextStylePolicy FileWidth="120" EolMarker="Unix" inheritsSet="VisualStudio" inheritsScope="text/plain" scope="text/x-csharp" /> |
|
205 | 204 | <DotNetNamingPolicy DirectoryNamespaceAssociation="PrefixedHierarchical" ResourceNamePolicy="MSBuild" /> |
|
206 | 205 | <TextStylePolicy FileWidth="120" TabsToSpaces="False" inheritsSet="VisualStudio" inheritsScope="text/plain" scope="application/xml" /> |
|
207 | 206 | <XmlFormattingPolicy inheritsSet="Mono" inheritsScope="application/xml" scope="application/xml" /> |
|
208 | 207 | <TextStylePolicy FileWidth="120" TabsToSpaces="False" inheritsSet="VisualStudio" inheritsScope="text/plain" scope="text/plain" /> |
|
209 | 208 | <NameConventionPolicy> |
|
210 | 209 | <Rules> |
|
211 | 210 | <NamingRule Name="Namespaces" AffectedEntity="Namespace" VisibilityMask="VisibilityMask" NamingStyle="PascalCase" IncludeInstanceMembers="True" IncludeStaticEntities="True" /> |
|
212 | 211 | <NamingRule Name="Types" AffectedEntity="Class, Struct, Enum, Delegate" VisibilityMask="VisibilityMask" NamingStyle="PascalCase" IncludeInstanceMembers="True" IncludeStaticEntities="True" /> |
|
213 | 212 | <NamingRule Name="Interfaces" AffectedEntity="Interface" VisibilityMask="VisibilityMask" NamingStyle="PascalCase" IncludeInstanceMembers="True" IncludeStaticEntities="True"> |
|
214 | 213 | <RequiredPrefixes> |
|
215 | 214 | <String>I</String> |
|
216 | 215 | </RequiredPrefixes> |
|
217 | 216 | </NamingRule> |
|
218 | 217 | <NamingRule Name="Attributes" AffectedEntity="CustomAttributes" VisibilityMask="VisibilityMask" NamingStyle="PascalCase" IncludeInstanceMembers="True" IncludeStaticEntities="True"> |
|
219 | 218 | <RequiredSuffixes> |
|
220 | 219 | <String>Attribute</String> |
|
221 | 220 | </RequiredSuffixes> |
|
222 | 221 | </NamingRule> |
|
223 | 222 | <NamingRule Name="Event Arguments" AffectedEntity="CustomEventArgs" VisibilityMask="VisibilityMask" NamingStyle="PascalCase" IncludeInstanceMembers="True" IncludeStaticEntities="True"> |
|
224 | 223 | <RequiredSuffixes> |
|
225 | 224 | <String>EventArgs</String> |
|
226 | 225 | </RequiredSuffixes> |
|
227 | 226 | </NamingRule> |
|
228 | 227 | <NamingRule Name="Exceptions" AffectedEntity="CustomExceptions" VisibilityMask="VisibilityMask" NamingStyle="PascalCase" IncludeInstanceMembers="True" IncludeStaticEntities="True"> |
|
229 | 228 | <RequiredSuffixes> |
|
230 | 229 | <String>Exception</String> |
|
231 | 230 | </RequiredSuffixes> |
|
232 | 231 | </NamingRule> |
|
233 | 232 | <NamingRule Name="Methods" AffectedEntity="Methods" VisibilityMask="VisibilityMask" NamingStyle="PascalCase" IncludeInstanceMembers="True" IncludeStaticEntities="True" /> |
|
234 | 233 | <NamingRule Name="Static Readonly Fields" AffectedEntity="ReadonlyField" VisibilityMask="Internal, Protected, Public" NamingStyle="CamelCase" IncludeInstanceMembers="False" IncludeStaticEntities="True" /> |
|
235 | 234 | <NamingRule Name="Fields (Non Private)" AffectedEntity="Field" VisibilityMask="Internal, Public" NamingStyle="CamelCase" IncludeInstanceMembers="True" IncludeStaticEntities="True" /> |
|
236 | 235 | <NamingRule Name="ReadOnly Fields (Non Private)" AffectedEntity="ReadonlyField" VisibilityMask="Internal, Public" NamingStyle="CamelCase" IncludeInstanceMembers="True" IncludeStaticEntities="False" /> |
|
237 | 236 | <NamingRule Name="Fields (Private)" AffectedEntity="Field, ReadonlyField" VisibilityMask="Private, Protected" NamingStyle="CamelCase" IncludeInstanceMembers="True" IncludeStaticEntities="False"> |
|
238 | 237 | <RequiredPrefixes> |
|
239 | 238 | <String>m_</String> |
|
240 | 239 | </RequiredPrefixes> |
|
241 | 240 | </NamingRule> |
|
242 | 241 | <NamingRule Name="Static Fields (Private)" AffectedEntity="Field" VisibilityMask="Private" NamingStyle="CamelCase" IncludeInstanceMembers="False" IncludeStaticEntities="True"> |
|
243 | 242 | <RequiredPrefixes> |
|
244 | 243 | <String>_</String> |
|
245 | 244 | </RequiredPrefixes> |
|
246 | 245 | </NamingRule> |
|
247 | 246 | <NamingRule Name="ReadOnly Fields (Private)" AffectedEntity="ReadonlyField" VisibilityMask="Private, Protected" NamingStyle="CamelCase" IncludeInstanceMembers="True" IncludeStaticEntities="False"> |
|
248 | 247 | <RequiredPrefixes> |
|
249 | 248 | <String>m_</String> |
|
250 | 249 | </RequiredPrefixes> |
|
251 | 250 | </NamingRule> |
|
252 | 251 | <NamingRule Name="Constant Fields" AffectedEntity="ConstantField" VisibilityMask="VisibilityMask" NamingStyle="AllUpper" IncludeInstanceMembers="True" IncludeStaticEntities="True" /> |
|
253 | 252 | <NamingRule Name="Properties" AffectedEntity="Property" VisibilityMask="VisibilityMask" NamingStyle="PascalCase" IncludeInstanceMembers="True" IncludeStaticEntities="True" /> |
|
254 | 253 | <NamingRule Name="Events" AffectedEntity="Event" VisibilityMask="VisibilityMask" NamingStyle="PascalCase" IncludeInstanceMembers="True" IncludeStaticEntities="True" /> |
|
255 | 254 | <NamingRule Name="Enum Members" AffectedEntity="EnumMember" VisibilityMask="VisibilityMask" NamingStyle="PascalCase" IncludeInstanceMembers="True" IncludeStaticEntities="True" /> |
|
256 | 255 | <NamingRule Name="Parameters" AffectedEntity="Parameter, LocalVariable" VisibilityMask="VisibilityMask" NamingStyle="CamelCase" IncludeInstanceMembers="True" IncludeStaticEntities="True" /> |
|
257 | 256 | <NamingRule Name="Type Parameters" AffectedEntity="TypeParameter" VisibilityMask="VisibilityMask" NamingStyle="PascalCase" IncludeInstanceMembers="True" IncludeStaticEntities="True"> |
|
258 | 257 | <RequiredPrefixes> |
|
259 | 258 | <String>T</String> |
|
260 | 259 | </RequiredPrefixes> |
|
261 | 260 | </NamingRule> |
|
262 | 261 | </Rules> |
|
263 | 262 | </NameConventionPolicy> |
|
264 | 263 | </Policies> |
|
265 | 264 | </Properties> |
|
266 | 265 | </MonoDevelop> |
|
267 | 266 | </ProjectExtensions> |
|
268 | 267 | <ItemGroup> |
|
269 | 268 | <Folder Include="Components\" /> |
|
270 | 269 | <Folder Include="Automaton\RegularExpressions\" /> |
|
271 | 270 | <Folder Include="Formats\" /> |
|
272 | 271 | <Folder Include="Formats\JSON\" /> |
|
273 | 272 | </ItemGroup> |
|
274 | 273 | </Project> No newline at end of file |
|
1 | NO CONTENT: file was removed |
|
1 | NO CONTENT: file was removed |
|
1 | NO CONTENT: file was removed |
|
1 | NO CONTENT: file was removed |
General Comments 0
You need to be logged in to leave comments.
Login now