internal FA Sythesize(FA l, FA r, CGraph.CMergeGraphOperation.MergeOptions options)
{
//1.Create FA
m_currentFA = new FA();
m_ThompsonInfo = new ThompsonInfo(m_currentFA, m_ThompsonInfoKey);
//2.Merge left graph
CGraph.CMergeGraphOperation lmerge = m_currentFA.Merge(l, options);
//Console.WriteLine(l.ToString());
lmerge.MergeGraphInfo(l, GraphElementType.ET_EDGE, FA.m_FAINFOKEY);
lmerge.MergeGraphInfo(l, GraphElementType.ET_GRAPH, FA.m_FAINFOKEY);
lmerge.MergeGraphInfo(l, GraphElementType.ET_NODE, FA.m_FAINFOKEY);
lmerge.MergeGraphInfo(l, GraphElementType.ET_EDGE, m_ThompsonInfoKey);
lmerge.MergeGraphInfo(l, GraphElementType.ET_GRAPH, m_ThompsonInfoKey);
lmerge.MergeGraphInfo(l, GraphElementType.ET_NODE, m_ThompsonInfoKey);
CGraphNode il = lmerge.GetMirrorNode(l.M_Initial);
CGraphNode fl = lmerge.GetMirrorNode(l.GetFinalStates()[0]);
//3.Merge right graph
CGraph.CMergeGraphOperation rmerge = m_currentFA.Merge(r, options);
rmerge.MergeGraphInfo(r, GraphElementType.ET_EDGE, FA.m_FAINFOKEY);
rmerge.MergeGraphInfo(r, GraphElementType.ET_GRAPH, FA.m_FAINFOKEY);
rmerge.MergeGraphInfo(r, GraphElementType.ET_NODE, FA.m_FAINFOKEY);
rmerge.MergeGraphInfo(r, GraphElementType.ET_EDGE, m_ThompsonInfoKey);
rmerge.MergeGraphInfo(r, GraphElementType.ET_GRAPH, m_ThompsonInfoKey);
rmerge.MergeGraphInfo(r, GraphElementType.ET_NODE, m_ThompsonInfoKey);
CGraphNode ir = rmerge.GetMirrorNode(r.M_Initial);
CGraphNode fr = rmerge.GetMirrorNode(r.GetFinalStates()[0]);
//4.Create the initial and the final node
CGraphNode FAinit = m_currentFA.CreateGraphNode <CGraphNode>();
CGraphNode FAfinal = m_currentFA.CreateGraphNode <CGraphNode>();
m_ThompsonInfo.InitNodeInfo(FAinit, new ThompsonNodeFAInfo());
m_ThompsonInfo.InitNodeInfo(FAfinal, new ThompsonNodeFAInfo());
m_currentFA.M_Initial = FAinit;
m_currentFA.SetFinalState(FAfinal);
m_currentFA.UpdateAlphabet();
m_currentFA.AddGraphEdge <CGraphEdge, CGraphNode>(FAinit, il, GraphType.GT_DIRECTED);
m_currentFA.AddGraphEdge <CGraphEdge, CGraphNode>(FAinit, ir, GraphType.GT_DIRECTED);
m_currentFA.AddGraphEdge <CGraphEdge, CGraphNode>(fr, FAfinal, GraphType.GT_DIRECTED);
m_currentFA.AddGraphEdge <CGraphEdge, CGraphNode>(fl, FAfinal, GraphType.GT_DIRECTED);
// Update closure information from operand closure
// Update closure information from operand closure
UpdateClosureInformation(l, m_currentFA, lmerge);
UpdateClosureInformation(r, m_currentFA, rmerge);
//7.Return result
return(m_currentFA);
}
public override FA VisitLexerDescription(CASTElement currentNode)
{
int i = 0;
FA leftFa = null, rightFa;
CGraph.CMergeGraphOperation.MergeOptions mergeOptions = CGraph.CMergeGraphOperation.MergeOptions.MO_DEFAULT;
CSubsetConstructionAlgorithm subcon;
CHopcroftAlgorithm hopmin;
CLexerDescription lexerDescription = currentNode as CLexerDescription;
List <CASTElement> rExpStatements = lexerDescription.GetContextChildren(ContextType.CT_LEXERDESCRIPTION_BODY);
// Preserve labels of RegExp-derived NFA
if (!m_options.IsSet(ThompsonOptions.TO_STEPS))
{
mergeOptions = CGraph.CMergeGraphOperation.MergeOptions.MO_PRESERVELABELS;
}
//1. Create FA
foreach (var rExpStatement in rExpStatements)
{
if (i > 0)
{
rightFa = Visit(rExpStatement);
//2.Synthesize the two FAs to a new one
CThompsonAlternationTemplate alttempSyn = new CThompsonAlternationTemplate(this.GetHashCode());
leftFa = alttempSyn.Sythesize(leftFa, rightFa, mergeOptions);
// Prefix node elements of the resulting graph with
CIt_GraphNodes it = new CIt_GraphNodes(leftFa);
for (it.Begin(); !it.End(); it.Next())
{
leftFa.PrefixElementLabel(leftFa.GetFANodePrefix(it.M_CurrentItem), it.M_CurrentItem);
}
}
else
{
leftFa = Visit(rExpStatement);
}
i++;
}
m_NFA = leftFa;
m_NFA.UpdateAlphabet();
m_ReportingServices.ExctractThompsonStep(m_NFA, @"merge.dot", this.GetHashCode());
if (i > 1)
{
m_ReportingServices.AddThompsonStepToReporting(m_NFA, this.GetHashCode(), true);
}
else
{
m_ReportingServices.ThompsonStepsGenerate();
}
//return the final-synthesized FA
return(m_NFA);
}
internal FA Sythesize(FA l, FA r, CGraph.CMergeGraphOperation.MergeOptions options)
{
//1.Create FA
FA templateFA = new FA();
//2.Merge left graph
CGraph.CMergeGraphOperation lmerge = templateFA.Merge(l, options);
//Console.WriteLine(l.ToString());
lmerge.MergeGraphInfo(l, GraphElementType.ET_EDGE, FA.m_FAINFOKEY);
lmerge.MergeGraphInfo(l, GraphElementType.ET_GRAPH, FA.m_FAINFOKEY);
lmerge.MergeGraphInfo(l, GraphElementType.ET_NODE, FA.m_FAINFOKEY);
CGraphNode il = lmerge.GetMirrorNode(l.M_Initial);
CGraphNode fl = lmerge.GetMirrorNode(l.GetFinalStates()[0]);
//3.Merge right graph
CGraph.CMergeGraphOperation rmerge = templateFA.Merge(r, options);
rmerge.MergeGraphInfo(r, GraphElementType.ET_EDGE, FA.m_FAINFOKEY);
rmerge.MergeGraphInfo(r, GraphElementType.ET_GRAPH, FA.m_FAINFOKEY);
rmerge.MergeGraphInfo(r, GraphElementType.ET_NODE, FA.m_FAINFOKEY);
CGraphNode ir = rmerge.GetMirrorNode(r.M_Initial);
CGraphNode fr = rmerge.GetMirrorNode(r.GetFinalStates()[0]);
//4.Create the initial and the final node
CGraphNode FAinit = templateFA.CreateGraphNode <CGraphNode>();
CGraphNode FAfinal = templateFA.CreateGraphNode <CGraphNode>();
templateFA.M_Initial = FAinit;
templateFA.SetFinalState(FAfinal);
templateFA.UpdateAlphabet();
templateFA.AddGraphEdge <CGraphEdge, CGraphNode>(FAinit, il, GraphType.GT_DIRECTED);
templateFA.AddGraphEdge <CGraphEdge, CGraphNode>(FAinit, ir, GraphType.GT_DIRECTED);
templateFA.AddGraphEdge <CGraphEdge, CGraphNode>(fr, FAfinal, GraphType.GT_DIRECTED);
templateFA.AddGraphEdge <CGraphEdge, CGraphNode>(fl, FAfinal, GraphType.GT_DIRECTED);
//7.Return result
return(templateFA);
}
