1324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver/*
2324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * [The "BSD licence"]
3324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Copyright (c) 2005-2008 Terence Parr
4324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * All rights reserved.
5324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver *
6324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Conversion to C#:
7324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Copyright (c) 2008-2009 Sam Harwell, Pixel Mine, Inc.
8324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * All rights reserved.
9324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver *
10324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Redistribution and use in source and binary forms, with or without
11324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * modification, are permitted provided that the following conditions
12324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * are met:
13324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 1. Redistributions of source code must retain the above copyright
14324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver *    notice, this list of conditions and the following disclaimer.
15324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 2. Redistributions in binary form must reproduce the above copyright
16324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver *    notice, this list of conditions and the following disclaimer in the
17324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver *    documentation and/or other materials provided with the distribution.
18324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 3. The name of the author may not be used to endorse or promote products
19324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver *    derived from this software without specific prior written permission.
20324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver *
21324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
22324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
23324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
24324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
25324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
26324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
27324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
28324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
29324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
30324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */
32324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver
33324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruvernamespace Antlr.Runtime.Tree
34324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver{
35324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver    using IList = System.Collections.IList;
36324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver
37324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver    [System.Serializable]
38324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver    public class RewriteRuleSubtreeStream : RewriteRuleElementStream
39324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver    {
40324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver        public RewriteRuleSubtreeStream( ITreeAdaptor adaptor, string elementDescription )
41324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver            : base( adaptor, elementDescription )
42324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver        {
43324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver        }
44324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver
45324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver        /** <summary>Create a stream with one element</summary> */
46324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver        public RewriteRuleSubtreeStream( ITreeAdaptor adaptor, string elementDescription, object oneElement )
47324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver            : base( adaptor, elementDescription, oneElement )
48324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver        {
49324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver        }
50324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver
51324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver        /** <summary>Create a stream, but feed off an existing list</summary> */
52324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver        public RewriteRuleSubtreeStream( ITreeAdaptor adaptor, string elementDescription, IList elements )
53324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver            : base( adaptor, elementDescription, elements )
54324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver        {
55324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver        }
56324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver
57324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver        /** <summary>
58324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver         *  Treat next element as a single node even if it's a subtree.
59324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver         *  This is used instead of next() when the result has to be a
60324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver         *  tree root node.  Also prevents us from duplicating recently-added
61324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver         *  children; e.g., ^(type ID)+ adds ID to type and then 2nd iteration
62324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver         *  must dup the type node, but ID has been added.
63324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver         *  </summary>
64324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver         *
65324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver         *  <remarks>
66324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver         *  Referencing a rule result twice is ok; dup entire tree as
67324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver         *  we can't be adding trees as root; e.g., expr expr.
68324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver         *
69324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver         *  Hideous code duplication here with super.next().  Can't think of
70324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver         *  a proper way to refactor.  This needs to always call dup node
71324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver         *  and super.next() doesn't know which to call: dup node or dup tree.
72324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver         *  </remarks>
73324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver         */
74324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver        public virtual object NextNode()
75324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver        {
76324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver            //System.Console.WriteLine("nextNode: elements={0}, singleElement={1}", elements, ((ITree)singleElement).ToStringTree());
77324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver            int n = Count;
78324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver            if ( dirty || ( cursor >= n && n == 1 ) )
79324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver            {
80324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver                // if out of elements and size is 1, dup (at most a single node
81324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver                // since this is for making root nodes).
82324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver                object el = NextCore();
83324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver                return adaptor.DupNode( el );
84324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver            }
85324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver            // test size above then fetch
86324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver            object tree = NextCore();
87324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver            while (adaptor.IsNil(tree) && adaptor.GetChildCount(tree) == 1)
88324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver                tree = adaptor.GetChild(tree, 0);
89324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver            //System.Console.WriteLine("_next={0}", ((ITree)tree).ToStringTree());
90324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver            object el2 = adaptor.DupNode(tree); // dup just the root (want node here)
91324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver            return el2;
92324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver        }
93324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver
94324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver        protected override object Dup( object el )
95324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver        {
96324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver            return adaptor.DupTree( el );
97324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver        }
98324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver    }
99324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver}
100