HomeSort by relevance Sort by last modified time
    Searched defs:Nil (Results 1 - 8 of 8) sorted by null

  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/SlimParsing/Tree/
ITreeFactory.cs 45 TTree Nil();
ITreeAdaptor`1.cs 60 * Return a nil node (an empty but non-null node) that can hold
62 * use "t=adaptor.nil(); t.addChild(x); t.addChild(y);"
65 T Nil();
87 /** <summary>Is tree considered a nil node used to make lists of child nodes?</summary> */
102 * If oldRoot is a nil root, just copy or move the children to newRoot.
103 * If not a nil root, make oldRoot a child of newRoot.
107 * old=^(nil a b c), new=r yields ^(r a b c)
110 * If newRoot is a nil-rooted single child tree, use the single
113 * old=^(nil a b c), new=^(nil r) yields ^(r a b c
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/
DebugTreeAdaptor.cs 106 public virtual object Nil() {
107 object node = adaptor.Nil();
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
BaseTreeAdaptor.cs 51 public virtual object Nil() {
124 * If oldRoot is a nil root, just copy or move the children to newRoot.
125 * If not a nil root, make oldRoot a child of newRoot.
129 * old=^(nil a b c), new=r yields ^(r a b c)
132 * If newRoot is a nil-rooted single child tree, use the single
135 * old=^(nil a b c), new=^(nil r) yields ^(r a b c)
136 * old=^(a b c), new=^(nil r) yields ^(r ^(a b c))
141 * old=null, new=^(nil r) yields ^(nil r
    [all...]
ITreeAdaptor.cs 72 * Return a nil node (an empty but non-null node) that can hold
74 * use "t=adaptor.nil(); t.addChild(x); t.addChild(y);"
77 object Nil();
99 /** <summary>Is tree considered a nil node used to make lists of child nodes?</summary> */
114 * If oldRoot is a nil root, just copy or move the children to newRoot.
115 * If not a nil root, make oldRoot a child of newRoot.
119 * old=^(nil a b c), new=r yields ^(r a b c)
122 * If newRoot is a nil-rooted single child tree, use the single
125 * old=^(nil a b c), new=^(nil r) yields ^(r a b c
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
BaseTreeAdaptor.cs 54 public virtual object Nil()
158 * If oldRoot is a nil root, just copy or move the children to newRoot.
159 * If not a nil root, make oldRoot a child of newRoot.
163 * old=^(nil a b c), new=r yields ^(r a b c)
166 * If newRoot is a nil-rooted single child tree, use the single
169 * old=^(nil a b c), new=^(nil r) yields ^(r a b c)
170 * old=^(a b c), new=^(nil r) yields ^(r ^(a b c))
175 * old=null, new=^(nil r) yields ^(nil r
    [all...]
ITreeAdaptor.cs 128 * Return a nil node (an empty but non-null node) that can hold
130 * use "t=adaptor.nil(); t.addChild(x); t.addChild(y);"
133 object Nil();
155 /** <summary>Is tree considered a nil node used to make lists of child nodes?</summary> */
170 * If oldRoot is a nil root, just copy or move the children to newRoot.
171 * If not a nil root, make oldRoot a child of newRoot.
175 * old=^(nil a b c), new=r yields ^(r a b c)
178 * If newRoot is a nil-rooted single child tree, use the single
181 * old=^(nil a b c), new=^(nil r) yields ^(r a b c
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/
DebugTreeAdaptor.cs 138 public virtual object Nil()
140 object node = adaptor.Nil();

Completed in 176 milliseconds