private static SubrulesTokenChanges RemoveWorstPaths(ParsedSequence seq, int end, SubrulesTokenChanges parses, out TokenChanges comulativeMin)
{
var comulativeCost = new SubrulesTokenChanges();
bool updated = true;
while (updated)
{
updated = false;
foreach (var parse in parses)
{
var subrule = parse.Key;
TokenChanges oldCount;
if (!comulativeCost.TryGetValue(subrule, out oldCount))
updated = true;
TokenChanges min;
if (seq.StartPos == subrule.Begin && seq.ParsingSequence.StartStates.Contains(subrule.State))
min = new TokenChanges();
else
{
min = TokenChanges.Fail;
TokenChanges prevCount;
foreach (var prevSubrule in seq.GetPrevSubrules(subrule, parses.Keys))
if (comulativeCost.TryGetValue(prevSubrule, out prevCount))
min = TokenChanges.Min(min, prevCount);
}
var newCount = AddOrFail(min, parses[subrule]);
comulativeCost[subrule] = newCount;
updated = updated || oldCount != newCount;
}
}
var toProcess = new SCG.Queue<ParsedSubrule>(seq.GetLastSubrules(parses.Keys, end));
var comulativeMin2 = toProcess.Min(s => comulativeCost[s]);
comulativeMin = comulativeMin2;
toProcess = new SCG.Queue<ParsedSubrule>(toProcess.Where(s => comulativeCost[s] == comulativeMin2));
var good = new SubrulesTokenChanges();
while (toProcess.Count > 0)
{
var subrule = toProcess.Dequeue();
if (good.ContainsKey(subrule))
continue;
good.Add(subrule, parses[subrule]);
var prev = seq.GetPrevSubrules(subrule, parses.Keys).ToList();
if (prev.Count > 0)
{
TokenChanges min;
if (seq.StartPos == subrule.Begin && seq.ParsingSequence.StartStates.Contains(subrule.State))
min = new TokenChanges();
else
min = prev.Min(s => comulativeCost[s]);
foreach (var prevSubrule in prev)
if (comulativeCost[prevSubrule] == min)
toProcess.Enqueue(prevSubrule);
}
}
return good;
}
private TokenChanges FindBestPath(ParsedSequence seq, int end, Dictionary<ParsedSequenceKey, SequenceTokenChanges> memiozation)
{
if (_parseResult.TerminateParsing)
throw new OperationCanceledException();
SequenceTokenChanges result;
var key = new ParsedSequenceKey(seq, end);
if (memiozation.TryGetValue(key, out result))
return result.TotalTokenChanges;
if (seq.StartPos == end)
{
var tokenChanges = new TokenChanges(seq.ParsingSequence.MandatoryTokenCount, 0);
memiozation.Add(key, new SequenceTokenChanges(new SubrulesTokenChanges(), tokenChanges));
return tokenChanges;
}
var results = new SubrulesTokenChanges();
var validSubrules = seq.GetValidSubrules(end).ToList();
if (validSubrules.Count == 0)
{
var tokenChanges = new TokenChanges();
memiozation.Add(key, new SequenceTokenChanges(results, tokenChanges));
return tokenChanges;
}
memiozation.Add(key, new SequenceTokenChanges(results, TokenChanges.Fail));
foreach (var subrule in validSubrules)
{
TokenChanges localMin = TokenChanges.Fail;
if (_deletedToken.ContainsKey(new ParsedSequenceAndSubrule(seq, subrule)))
localMin = new TokenChanges(0, 1);
else
localMin = LocalMinForSubSequence(seq, memiozation, subrule, localMin);
results[subrule] = localMin;
}
TokenChanges comulativeMin;
if (results.Count == 0)
{ }
var bestResults = RemoveWorstPaths(seq, end, results, out comulativeMin);
var result2 = new SequenceTokenChanges(bestResults, comulativeMin);
memiozation[key] = result2;
return result2.TotalTokenChanges;
}
private FlattenSequences FlattenSubrule(FlattenSequences prevs, ParseResult parseResult, ParsedSequence seq, SubrulesTokenChanges parses, ParsedSubrule subrule, TokenChanges tokenChanges, Dictionary<ParsedSequenceKey, SequenceTokenChanges> memiozation)
{
Begin:
//var txt = parseResult.Text.Substring(subrule.Begin, subrule.End - subrule.Begin);
//var stateIndex = subrule.State;
//var state = stateIndex < 0 ? null : seq.ParsingSequence.States[stateIndex];
if (subrule.End == 11)
{ }
var currentNodes = new FlattenSequences();
//var subruledDesc = seq.GetSubruleDescription(subrule.State);
if (subrule.IsEmpty)
{
//if (subruleInsertedTokens > 0)
// Debug.WriteLine("Inserted = " + subruleInsertedTokens + " - " + subruledDesc + " Seq: " + seq);
}
else
{
var sequences = seq.GetSequencesForSubrule(subrule).ToArray();
if (sequences.Length > 1)
{ }
foreach (var subSequences in sequences)
{
//Debug.WriteLine(subruledDesc);
var result = FlattenSequence(prevs, parseResult, subSequences, subrule.End, tokenChanges, memiozation);
currentNodes.AddRange(result);
}
}
if (currentNodes.Count == 0) // если не было сабсиквенсов, надо создать продолжения из текущего сабруля
{
foreach (var prev in prevs)
currentNodes.Add(new ParsedSequenceAndSubrules.Cons(new SubruleTokenChanges(seq, subrule, tokenChanges), prev));
}
var nextSubrules = seq.GetNextSubrules(subrule, parses.Keys).ToArray();
switch (nextSubrules.Length)
{
case 0:
return currentNodes;
case 1:
{
var nextSubrule = nextSubrules[0];
if (nextSubrule.State == 9 && nextSubrule.Begin == 8 && nextSubrule.End == 15)
{ }
tokenChanges = parses[nextSubrule];
if (tokenChanges.IsFail)
return currentNodes;
// recursive self call...
prevs = currentNodes;
subrule = nextSubrule;
goto Begin;
return null;
}
default:
{
var resultNodes = new FlattenSequences();
foreach (var nextSubrule in nextSubrules)
{
var newSubruleInsertedTokens = parses[nextSubrule];
if (newSubruleInsertedTokens.IsFail)
continue;
var result = FlattenSubrule(currentNodes, parseResult, seq, parses, nextSubrule, newSubruleInsertedTokens, memiozation);
resultNodes.AddRange(result);
}
return resultNodes;
}
}
}
private static SubrulesTokenChanges RemoveWorstPaths(ParsedSequence seq, int end, SubrulesTokenChanges parses, out TokenChanges comulativeMin)
{
var comulativeCost = new SubrulesTokenChanges();
bool updated = true;
while (updated)
{
updated = false;
foreach (var parse in parses)
{
var subrule = parse.Key;
TokenChanges oldCount;
if (!comulativeCost.TryGetValue(subrule, out oldCount))
{
updated = true;
}
TokenChanges min;
if (seq.StartPos == subrule.Begin && seq.ParsingSequence.StartStates.Contains(subrule.State))
{
min = new TokenChanges();
}
else
{
min = TokenChanges.Fail;
TokenChanges prevCount;
foreach (var prevSubrule in seq.GetPrevSubrules(subrule, parses.Keys))
{
if (comulativeCost.TryGetValue(prevSubrule, out prevCount))
{
min = TokenChanges.Min(min, prevCount);
}
}
}
var newCount = AddOrFail(min, parses[subrule]);
comulativeCost[subrule] = newCount;
updated = updated || oldCount != newCount;
}
}
var toProcess = new SCG.Queue <ParsedSubrule>(seq.GetLastSubrules(parses.Keys, end));
var comulativeMin2 = toProcess.Min(s => comulativeCost[s]);
comulativeMin = comulativeMin2;
toProcess = new SCG.Queue <ParsedSubrule>(toProcess.Where(s => comulativeCost[s] == comulativeMin2));
var good = new SubrulesTokenChanges();
while (toProcess.Count > 0)
{
var subrule = toProcess.Dequeue();
if (good.ContainsKey(subrule))
{
continue;
}
good.Add(subrule, parses[subrule]);
var prev = seq.GetPrevSubrules(subrule, parses.Keys).ToList();
if (prev.Count > 0)
{
TokenChanges min;
if (seq.StartPos == subrule.Begin && seq.ParsingSequence.StartStates.Contains(subrule.State))
{
min = new TokenChanges();
}
else
{
min = prev.Min(s => comulativeCost[s]);
}
foreach (var prevSubrule in prev)
{
if (comulativeCost[prevSubrule] == min)
{
toProcess.Enqueue(prevSubrule);
}
}
}
}
return(good);
}
private TokenChanges FindBestPath(ParsedSequence seq, int end, Dictionary <ParsedSequenceKey, SequenceTokenChanges> memiozation)
{
if (_parseResult.TerminateParsing)
{
throw new OperationCanceledException();
}
SequenceTokenChanges result;
var key = new ParsedSequenceKey(seq, end);
if (memiozation.TryGetValue(key, out result))
{
return(result.TotalTokenChanges);
}
if (seq.StartPos == end)
{
var tokenChanges = new TokenChanges(seq.ParsingSequence.MandatoryTokenCount, 0);
memiozation.Add(key, new SequenceTokenChanges(new SubrulesTokenChanges(), tokenChanges));
return(tokenChanges);
}
var results = new SubrulesTokenChanges();
var validSubrules = seq.GetValidSubrules(end).ToList();
if (validSubrules.Count == 0)
{
var tokenChanges = new TokenChanges();
memiozation.Add(key, new SequenceTokenChanges(results, tokenChanges));
return(tokenChanges);
}
memiozation.Add(key, new SequenceTokenChanges(results, TokenChanges.Fail));
foreach (var subrule in validSubrules)
{
TokenChanges localMin = TokenChanges.Fail;
if (_deletedToken.ContainsKey(new ParsedSequenceAndSubrule(seq, subrule)))
{
localMin = new TokenChanges(0, 1);
}
else
{
localMin = LocalMinForSubSequence(seq, memiozation, subrule, localMin);
}
results[subrule] = localMin;
}
TokenChanges comulativeMin;
if (results.Count == 0)
{
}
var bestResults = RemoveWorstPaths(seq, end, results, out comulativeMin);
var result2 = new SequenceTokenChanges(bestResults, comulativeMin);
memiozation[key] = result2;
return(result2.TotalTokenChanges);
}
private FlattenSequences FlattenSubrule(FlattenSequences prevs, ParseResult parseResult, ParsedSequence seq, SubrulesTokenChanges parses, ParsedSubrule subrule, TokenChanges tokenChanges, Dictionary <ParsedSequenceKey, SequenceTokenChanges> memiozation)
{
Begin:
//var txt = parseResult.Text.Substring(subrule.Begin, subrule.End - subrule.Begin);
//var stateIndex = subrule.State;
//var state = stateIndex < 0 ? null : seq.ParsingSequence.States[stateIndex];
if (subrule.End == 11)
{
}
var currentNodes = new FlattenSequences();
//var subruledDesc = seq.GetSubruleDescription(subrule.State);
if (subrule.IsEmpty)
{
//if (subruleInsertedTokens > 0)
// Debug.WriteLine("Inserted = " + subruleInsertedTokens + " - " + subruledDesc + " Seq: " + seq);
}
else
{
var sequences = seq.GetSequencesForSubrule(subrule).ToArray();
if (sequences.Length > 1)
{
}
foreach (var subSequences in sequences)
{
//Debug.WriteLine(subruledDesc);
var result = FlattenSequence(prevs, parseResult, subSequences, subrule.End, tokenChanges, memiozation);
currentNodes.AddRange(result);
}
}
if (currentNodes.Count == 0) // если не было сабсиквенсов, надо создать продолжения из текущего сабруля
{
foreach (var prev in prevs)
{
currentNodes.Add(new ParsedSequenceAndSubrules.Cons(new SubruleTokenChanges(seq, subrule, tokenChanges), prev));
}
}
var nextSubrules = seq.GetNextSubrules(subrule, parses.Keys).ToArray();
switch (nextSubrules.Length)
{
case 0:
return(currentNodes);
case 1:
{
var nextSubrule = nextSubrules[0];
if (nextSubrule.State == 9 && nextSubrule.Begin == 8 && nextSubrule.End == 15)
{
}
tokenChanges = parses[nextSubrule];
if (tokenChanges.IsFail)
{
return(currentNodes);
}
// recursive self call...
prevs = currentNodes;
subrule = nextSubrule;
goto Begin;
return(null);
}
default:
{
var resultNodes = new FlattenSequences();
foreach (var nextSubrule in nextSubrules)
{
var newSubruleInsertedTokens = parses[nextSubrule];
if (newSubruleInsertedTokens.IsFail)
{
continue;
}
var result = FlattenSubrule(currentNodes, parseResult, seq, parses, nextSubrule, newSubruleInsertedTokens, memiozation);
resultNodes.AddRange(result);
}
return(resultNodes);
}
}
}
