forked from jasder/antlr
392 lines
14 KiB
C#
392 lines
14 KiB
C#
/*
|
|
* [The "BSD license"]
|
|
* Copyright (c) 2013 Terence Parr
|
|
* Copyright (c) 2013 Sam Harwell
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. The name of the author may not be used to endorse or promote products
|
|
* derived from this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
using System;
|
|
using System.Collections.Generic;
|
|
using Antlr4.Runtime;
|
|
using Antlr4.Runtime.Misc;
|
|
using Antlr4.Runtime.Tree;
|
|
using Sharpen;
|
|
|
|
namespace Antlr4.Runtime
|
|
{
|
|
/// <summary>A rule invocation record for parsing.</summary>
|
|
/// <remarks>
|
|
/// A rule invocation record for parsing.
|
|
/// Contains all of the information about the current rule not stored in the
|
|
/// RuleContext. It handles parse tree children list, Any ATN state
|
|
/// tracing, and the default values available for rule indications:
|
|
/// start, stop, rule index, current alt number, current
|
|
/// ATN state.
|
|
/// Subclasses made for each rule and grammar track the parameters,
|
|
/// return values, locals, and labels specific to that rule. These
|
|
/// are the objects that are returned from rules.
|
|
/// Note text is not an actual field of a rule return value; it is computed
|
|
/// from start and stop using the input stream's toString() method. I
|
|
/// could add a ctor to this so that we can pass in and store the input
|
|
/// stream, but I'm not sure we want to do that. It would seem to be undefined
|
|
/// to get the .text property anyway if the rule matches tokens from multiple
|
|
/// input streams.
|
|
/// I do not use getters for fields of objects that are used simply to
|
|
/// group values such as this aggregate. The getters/setters are there to
|
|
/// satisfy the superclass interface.
|
|
/// </remarks>
|
|
public class ParserRuleContext : RuleContext
|
|
{
|
|
private static readonly Antlr4.Runtime.ParserRuleContext Empty = new Antlr4.Runtime.ParserRuleContext
|
|
();
|
|
|
|
/// <summary>
|
|
/// If we are debugging or building a parse tree for a visitor,
|
|
/// we need to track all of the tokens and rule invocations associated
|
|
/// with this rule's context.
|
|
/// </summary>
|
|
/// <remarks>
|
|
/// If we are debugging or building a parse tree for a visitor,
|
|
/// we need to track all of the tokens and rule invocations associated
|
|
/// with this rule's context. This is empty for parsing w/o tree constr.
|
|
/// operation because we don't the need to track the details about
|
|
/// how we parse this rule.
|
|
/// </remarks>
|
|
public IList<IParseTree> children;
|
|
|
|
/// <summary>
|
|
/// For debugging/tracing purposes, we want to track all of the nodes in
|
|
/// the ATN traversed by the parser for a particular rule.
|
|
/// </summary>
|
|
/// <remarks>
|
|
/// For debugging/tracing purposes, we want to track all of the nodes in
|
|
/// the ATN traversed by the parser for a particular rule.
|
|
/// This list indicates the sequence of ATN nodes used to match
|
|
/// the elements of the children list. This list does not include
|
|
/// ATN nodes and other rules used to match rule invocations. It
|
|
/// traces the rule invocation node itself but nothing inside that
|
|
/// other rule's ATN submachine.
|
|
/// There is NOT a one-to-one correspondence between the children and
|
|
/// states list. There are typically many nodes in the ATN traversed
|
|
/// for each element in the children list. For example, for a rule
|
|
/// invocation there is the invoking state and the following state.
|
|
/// The parser setState() method updates field s and adds it to this list
|
|
/// if we are debugging/tracing.
|
|
/// This does not trace states visited during prediction.
|
|
/// </remarks>
|
|
public IToken start;
|
|
|
|
/// <summary>
|
|
/// For debugging/tracing purposes, we want to track all of the nodes in
|
|
/// the ATN traversed by the parser for a particular rule.
|
|
/// </summary>
|
|
/// <remarks>
|
|
/// For debugging/tracing purposes, we want to track all of the nodes in
|
|
/// the ATN traversed by the parser for a particular rule.
|
|
/// This list indicates the sequence of ATN nodes used to match
|
|
/// the elements of the children list. This list does not include
|
|
/// ATN nodes and other rules used to match rule invocations. It
|
|
/// traces the rule invocation node itself but nothing inside that
|
|
/// other rule's ATN submachine.
|
|
/// There is NOT a one-to-one correspondence between the children and
|
|
/// states list. There are typically many nodes in the ATN traversed
|
|
/// for each element in the children list. For example, for a rule
|
|
/// invocation there is the invoking state and the following state.
|
|
/// The parser setState() method updates field s and adds it to this list
|
|
/// if we are debugging/tracing.
|
|
/// This does not trace states visited during prediction.
|
|
/// </remarks>
|
|
public IToken stop;
|
|
|
|
/// <summary>Set during parsing to identify which alt of rule parser is in.</summary>
|
|
/// <remarks>Set during parsing to identify which alt of rule parser is in.</remarks>
|
|
public int altNum;
|
|
|
|
/// <summary>The exception which forced this rule to return.</summary>
|
|
/// <remarks>
|
|
/// The exception which forced this rule to return. If the rule successfully
|
|
/// completed, this is
|
|
/// <code>null</code>
|
|
/// .
|
|
/// </remarks>
|
|
public RecognitionException exception;
|
|
|
|
public ParserRuleContext()
|
|
{
|
|
}
|
|
|
|
// public List<Integer> states;
|
|
public static Antlr4.Runtime.ParserRuleContext EmptyContext()
|
|
{
|
|
return Empty;
|
|
}
|
|
|
|
/// <summary>COPY a ctx (I'm deliberately not using copy constructor)</summary>
|
|
public virtual void CopyFrom(Antlr4.Runtime.ParserRuleContext ctx)
|
|
{
|
|
// from RuleContext
|
|
this.parent = ctx.parent;
|
|
this.invokingState = ctx.invokingState;
|
|
this.start = ctx.start;
|
|
this.stop = ctx.stop;
|
|
}
|
|
|
|
public ParserRuleContext(Antlr4.Runtime.ParserRuleContext parent, int invokingStateNumber
|
|
) : base(parent, invokingStateNumber)
|
|
{
|
|
}
|
|
|
|
// Double dispatch methods for listeners
|
|
public virtual void EnterRule(IParseTreeListener listener)
|
|
{
|
|
}
|
|
|
|
public virtual void ExitRule(IParseTreeListener listener)
|
|
{
|
|
}
|
|
|
|
/// <summary>Does not set parent link; other add methods do that</summary>
|
|
public virtual void AddChild(ITerminalNode t)
|
|
{
|
|
if (children == null)
|
|
{
|
|
children = new List<IParseTree>();
|
|
}
|
|
children.AddItem(t);
|
|
}
|
|
|
|
public virtual void AddChild(RuleContext ruleInvocation)
|
|
{
|
|
if (children == null)
|
|
{
|
|
children = new List<IParseTree>();
|
|
}
|
|
children.AddItem(ruleInvocation);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Used by enterOuterAlt to toss out a RuleContext previously added as
|
|
/// we entered a rule.
|
|
/// </summary>
|
|
/// <remarks>
|
|
/// Used by enterOuterAlt to toss out a RuleContext previously added as
|
|
/// we entered a rule. If we have # label, we will need to remove
|
|
/// generic ruleContext object.
|
|
/// </remarks>
|
|
public virtual void RemoveLastChild()
|
|
{
|
|
if (children != null)
|
|
{
|
|
children.Remove(children.Count - 1);
|
|
}
|
|
}
|
|
|
|
// public void trace(int s) {
|
|
// if ( states==null ) states = new ArrayList<Integer>();
|
|
// states.add(s);
|
|
// }
|
|
public virtual ITerminalNode AddChild(IToken matchedToken)
|
|
{
|
|
TerminalNodeImpl t = new TerminalNodeImpl(matchedToken);
|
|
AddChild(t);
|
|
t.parent = this;
|
|
return t;
|
|
}
|
|
|
|
public virtual IErrorNode AddErrorNode(IToken badToken)
|
|
{
|
|
ErrorNodeImpl t = new ErrorNodeImpl(badToken);
|
|
AddChild(t);
|
|
t.parent = this;
|
|
return t;
|
|
}
|
|
|
|
public override RuleContext Parent
|
|
{
|
|
get
|
|
{
|
|
return (Antlr4.Runtime.ParserRuleContext)base.Parent;
|
|
}
|
|
}
|
|
|
|
public override IParseTree GetChild(int i)
|
|
{
|
|
return children != null && i >= 0 && i < children.Count ? children[i] : null;
|
|
}
|
|
|
|
public virtual T GetChild<T, _T1>(Type<_T1> ctxType, int i) where T:IParseTree where
|
|
_T1:T
|
|
{
|
|
if (children == null || i < 0 || i >= children.Count)
|
|
{
|
|
return null;
|
|
}
|
|
int j = -1;
|
|
// what element have we found with ctxType?
|
|
foreach (IParseTree o in children)
|
|
{
|
|
if (ctxType.IsInstanceOfType(o))
|
|
{
|
|
j++;
|
|
if (j == i)
|
|
{
|
|
return ctxType.Cast(o);
|
|
}
|
|
}
|
|
}
|
|
return null;
|
|
}
|
|
|
|
public virtual ITerminalNode GetToken(int ttype, int i)
|
|
{
|
|
if (children == null || i < 0 || i >= children.Count)
|
|
{
|
|
return null;
|
|
}
|
|
int j = -1;
|
|
// what token with ttype have we found?
|
|
foreach (IParseTree o in children)
|
|
{
|
|
if (o is ITerminalNode)
|
|
{
|
|
ITerminalNode tnode = (ITerminalNode)o;
|
|
IToken symbol = tnode.Symbol;
|
|
if (symbol.Type == ttype)
|
|
{
|
|
j++;
|
|
if (j == i)
|
|
{
|
|
return tnode;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return null;
|
|
}
|
|
|
|
public virtual IList<ITerminalNode> GetTokens(int ttype)
|
|
{
|
|
if (children == null)
|
|
{
|
|
return Sharpen.Collections.EmptyList();
|
|
}
|
|
IList<ITerminalNode> tokens = null;
|
|
foreach (IParseTree o in children)
|
|
{
|
|
if (o is ITerminalNode)
|
|
{
|
|
ITerminalNode tnode = (ITerminalNode)o;
|
|
IToken symbol = tnode.Symbol;
|
|
if (symbol.Type == ttype)
|
|
{
|
|
if (tokens == null)
|
|
{
|
|
tokens = new List<ITerminalNode>();
|
|
}
|
|
tokens.AddItem(tnode);
|
|
}
|
|
}
|
|
}
|
|
if (tokens == null)
|
|
{
|
|
return Sharpen.Collections.EmptyList();
|
|
}
|
|
return tokens;
|
|
}
|
|
|
|
public virtual T GetRuleContext<T, _T1>(Type<_T1> ctxType, int i) where T:Antlr4.Runtime.ParserRuleContext
|
|
where _T1:T
|
|
{
|
|
return GetChild(ctxType, i);
|
|
}
|
|
|
|
public virtual IList<T> GetRuleContexts<T, _T1>(Type<_T1> ctxType) where T:Antlr4.Runtime.ParserRuleContext
|
|
where _T1:T
|
|
{
|
|
if (children == null)
|
|
{
|
|
return Sharpen.Collections.EmptyList();
|
|
}
|
|
IList<T> contexts = null;
|
|
foreach (IParseTree o in children)
|
|
{
|
|
if (ctxType.IsInstanceOfType(o))
|
|
{
|
|
if (contexts == null)
|
|
{
|
|
contexts = new List<T>();
|
|
}
|
|
contexts.AddItem(ctxType.Cast(o));
|
|
}
|
|
}
|
|
if (contexts == null)
|
|
{
|
|
return Sharpen.Collections.EmptyList();
|
|
}
|
|
return contexts;
|
|
}
|
|
|
|
public override int ChildCount
|
|
{
|
|
get
|
|
{
|
|
return children != null ? children.Count : 0;
|
|
}
|
|
}
|
|
|
|
public override Interval SourceInterval
|
|
{
|
|
get
|
|
{
|
|
if (start == null || stop == null)
|
|
{
|
|
return Interval.Invalid;
|
|
}
|
|
return Interval.Of(start.TokenIndex, stop.TokenIndex);
|
|
}
|
|
}
|
|
|
|
public virtual IToken GetStart()
|
|
{
|
|
return start;
|
|
}
|
|
|
|
public virtual IToken GetStop()
|
|
{
|
|
return stop;
|
|
}
|
|
|
|
/// <summary>Used for rule context info debugging during parse-time, not so much for ATN debugging
|
|
/// </summary>
|
|
public virtual string ToInfoString(Parser recognizer)
|
|
{
|
|
IList<string> rules = recognizer.GetRuleInvocationStack(this);
|
|
Sharpen.Collections.Reverse(rules);
|
|
return "ParserRuleContext" + rules + "{" + "altNum=" + altNum + ", start=" + start
|
|
+ ", stop=" + stop + '}';
|
|
}
|
|
}
|
|
}
|