当前位置: 首页>>代码示例>>C#>>正文


C# GrammarAST.DupTree方法代码示例

本文整理汇总了C#中Antlr4.Tool.Ast.GrammarAST.DupTree方法的典型用法代码示例。如果您正苦于以下问题:C# GrammarAST.DupTree方法的具体用法?C# GrammarAST.DupTree怎么用?C# GrammarAST.DupTree使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在Antlr4.Tool.Ast.GrammarAST的用法示例。


在下文中一共展示了GrammarAST.DupTree方法的2个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C#代码示例。

示例1: TranslateLeftFactoredElement


//.........这里部分代码省略.........
                    }

                    string marker = mode.IncludeFactoredAlts() ? ATNSimulator.RuleLfVariantMarker : ATNSimulator.RuleNolfVariantMarker;
                    element.SetText(element.Text + marker + factoredRule);

                    GrammarAST root = (GrammarAST)adaptor.Nil();

                    if (includeFactoredElement)
                    {
                        Debug.Assert(mode.IncludeFactoredAlts());
                        RuleRefAST factoredRuleRef = new RuleRefAST(adaptor.CreateToken(ANTLRParser.RULE_REF, factoredRule));
                        factoredRuleRef.SetOption(SUPPRESS_ACCESSOR, (GrammarAST)adaptor.Create(ANTLRParser.ID, "true"));
                        Rule factoredRuleDef = _rules[factoredRule];
                        if (factoredRuleDef is LeftRecursiveRule)
                        {
                            factoredRuleRef.SetOption(LeftRecursiveRuleTransformer.PRECEDENCE_OPTION_NAME, (GrammarAST)adaptor.Create(ANTLRParser.INT, "0"));
                        }

                        if (factoredRuleDef.args != null && factoredRuleDef.args.Size() > 0)
                        {
                            throw new NotImplementedException("Cannot left-factor rules with arguments yet.");
                        }

                        adaptor.AddChild(root, factoredRuleRef);
                    }

                    adaptor.AddChild(root, element);

                    return root;
                }

            case ANTLRParser.BLOCK:
                {
                    GrammarAST cloned = element.DupTree();
                    if (!TranslateLeftFactoredDecision(cloned, factoredRule, variant, mode, includeFactoredElement))
                    {
                        return null;
                    }

                    if (cloned.ChildCount != 1)
                    {
                        return null;
                    }

                    GrammarAST root = (GrammarAST)adaptor.Nil();
                    for (int i = 0; i < cloned.GetChild(0).ChildCount; i++)
                    {
                        adaptor.AddChild(root, cloned.GetChild(0).GetChild(i));
                    }

                    return root;
                }

            case ANTLRParser.POSITIVE_CLOSURE:
                {
                    /* a+
                     *
                     * =>
                     *
                     * factoredElement a_factored a*
                     */

                    GrammarAST originalChildElement = (GrammarAST)element.GetChild(0);
                    GrammarAST translatedElement = TranslateLeftFactoredElement(originalChildElement.DupTree(), factoredRule, variant, mode, includeFactoredElement);
                    if (translatedElement == null)
                    {
开发者ID:sharwell,项目名称:antlr4cs,代码行数:67,代码来源:LeftFactoringRuleTransformer.cs

示例2: ExpandOptionalQuantifiersForAlt

        protected virtual GrammarAST ExpandOptionalQuantifiersForAlt(GrammarAST alt)
        {
            if (alt.ChildCount == 0)
            {
                return null;
            }

            if (alt.GetChild(0).Type == ANTLRParser.OPTIONAL)
            {
                GrammarAST root = (GrammarAST)adaptor.Nil();

                GrammarAST alt2 = alt.DupTree();
                alt2.DeleteChild(0);
                if (alt2.ChildCount == 0)
                {
                    adaptor.AddChild(alt2, adaptor.Create(ANTLRParser.EPSILON, "EPSILON"));
                }

                alt.SetChild(0, alt.GetChild(0).GetChild(0));
                if (alt.GetChild(0).Type == ANTLRParser.BLOCK && alt.GetChild(0).ChildCount == 1 && alt.GetChild(0).GetChild(0).Type == ANTLRParser.ALT)
                {
                    GrammarAST list = (GrammarAST)adaptor.Nil();
                    foreach (object tree in ((GrammarAST)alt.GetChild(0).GetChild(0)).Children)
                    {
                        adaptor.AddChild(list, tree);
                    }

                    adaptor.ReplaceChildren(alt, 0, 0, list);
                }

                adaptor.AddChild(root, alt);
                adaptor.AddChild(root, alt2);
                return root;
            }
            else if (alt.GetChild(0).Type == ANTLRParser.CLOSURE)
            {
                GrammarAST root = (GrammarAST)adaptor.Nil();

                GrammarAST alt2 = alt.DupTree();
                alt2.DeleteChild(0);
                if (alt2.ChildCount == 0)
                {
                    adaptor.AddChild(alt2, adaptor.Create(ANTLRParser.EPSILON, "EPSILON"));
                }

                PlusBlockAST plusBlockAST = new PlusBlockAST(ANTLRParser.POSITIVE_CLOSURE, adaptor.CreateToken(ANTLRParser.POSITIVE_CLOSURE, "+"), null);
                for (int i = 0; i < alt.GetChild(0).ChildCount; i++)
                {
                    plusBlockAST.AddChild(alt.GetChild(0).GetChild(i));
                }

                alt.SetChild(0, plusBlockAST);

                adaptor.AddChild(root, alt);
                adaptor.AddChild(root, alt2);
                return root;
            }

            return alt;
        }
开发者ID:sharwell,项目名称:antlr4cs,代码行数:60,代码来源:LeftFactoringRuleTransformer.cs


注:本文中的Antlr4.Tool.Ast.GrammarAST.DupTree方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。