1 package org.drools.semantics.python;
2
3 /*
4 $Id: ExprAnalyzer.java,v 1.2 2003/03/25 19:47:32 tdiesler Exp $
5
6 Copyright 2002 (C) The Werken Company. All Rights Reserved.
7
8 Redistribution and use of this software and associated documentation
9 ("Software"), with or without modification, are permitted provided
10 that the following conditions are met:
11
12 1. Redistributions of source code must retain copyright
13 statements and notices. Redistributions must also contain a
14 copy of this document.
15
16 2. Redistributions in binary form must reproduce the
17 above copyright notice, this list of conditions and the
18 following disclaimer in the documentation and/or other
19 materials provided with the distribution.
20
21 3. The name "drools" must not be used to endorse or promote
22 products derived from this Software without prior written
23 permission of The Werken Company. For written permission,
24 please contact bob@werken.com.
25
26 4. Products derived from this Software may not be called "drools"
27 nor may "drools" appear in their names without prior written
28 permission of The Werken Company. "drools" is a registered
29 trademark of The Werken Company.
30
31 5. Due credit should be given to The Werken Company.
32 (http://drools.werken.com/).
33
34 THIS SOFTWARE IS PROVIDED BY THE WERKEN COMPANY AND CONTRIBUTORS
35 ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT
36 NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
37 FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
38 THE WERKEN COMPANY OR ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
39 INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
40 (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
41 SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
42 HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
43 STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
44 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
45 OF THE POSSIBILITY OF SUCH DAMAGE.
46
47 */
48
49 import org.drools.rule.Declaration;
50 import org.python.parser.ast.modType;
51
52 import java.util.HashSet;
53 import java.util.Iterator;
54 import java.util.Set;
55
56 /*** Analyzes python expressions for all mentioned variables.
57 *
58 * @author <a href="mailto:bob@eng.werken.com">bob mcwhirter</a>
59 *
60 * @version $Id: ExprAnalyzer.java,v 1.2 2003/03/25 19:47:32 tdiesler Exp $
61 */
62 public class ExprAnalyzer
63 {
64 // ------------------------------------------------------------
65 // Constructors
66 // ------------------------------------------------------------
67
68 /*** Construct.
69 */
70 public ExprAnalyzer()
71 {
72 // intentionally left blank
73 }
74
75 // ------------------------------------------------------------
76 // Instance methods
77 // ------------------------------------------------------------
78
79 /*** Analyze an expression.
80 *
81 * @param expr The expression to analyze.
82 * @param availDecls Total set of declarations available.
83 *
84 * @return The array of declarations used by the expression.
85 *
86 * @throws Exception If an error occurs while attempting
87 * to analyze the expression.
88 */
89
90 public Declaration[] analyze(modType expr,
91 Declaration[] availDecls) throws Exception
92 {
93 ExprVisitor visitor = new ExprVisitor();
94
95 Set availDeclSet = new HashSet();
96
97 for ( int i = 0 ; i < availDecls.length ; ++i )
98 {
99 availDeclSet.add( availDecls[i] );
100 }
101
102 Set declSet = new HashSet();
103
104 Set refs = (Set) visitor.eval_input( expr );
105
106 Iterator declIter = availDeclSet.iterator();
107 Declaration eachDecl = null;
108
109 while ( declIter.hasNext() )
110 {
111 eachDecl = (Declaration) declIter.next();
112
113 if ( refs.contains( eachDecl.getIdentifier() ) )
114 {
115 declSet.add( eachDecl );
116 declIter.remove();
117 refs.remove( eachDecl.getIdentifier() );
118 }
119 }
120
121 Declaration[] decls = new Declaration[ declSet.size() ];
122
123 declIter = declSet.iterator();
124 eachDecl = null;
125
126 int i = 0;
127
128 while ( declIter.hasNext() )
129 {
130 decls[ i++ ] = (Declaration) declIter.next();
131 }
132
133 return decls;
134
135 }
136 }
This page was automatically generated by Maven