public boolean isCompatible(Production p) {
bind.as t = getBindAs();
+ bind b = getBind();
+
if (t != null &&
- (t.value().equals(p.tag) ||
- (t.value().equals("") && getName().equals(p.tag))))
+ (t.value().equals(p.tag)))
return buildSequence(p)!=null;
- bind b = getBind();
- System.out.println(_bindable.getClass().getSimpleName() + ": " + _bindable.getSimpleName());
+ if (t != null &&
+ ((t.value().equals("") && getName().equals(p.tag))))
+ return buildSequence(p)!=null;
if (b != null && getName().equals(p.tag))
return buildSequence(p)!=null;
- bind.as n = getBindAs();
- if (n != null &&
- (n.value().equals(p.nonTerminal) ||
- (n.value().equals("") && getName().equals(p.nonTerminal))))
+ if (t != null &&
+ (t.value().equals(p.nonTerminal)))
+ return buildSequence(p)!=null;
+ if (t != null &&
+ ((t.value().equals("") && getName().equals(p.nonTerminal))))
return buildSequence(p)!=null;
-
if (b != null && getName().equals(p.nonTerminal))
return buildSequence(p)!=null;
argTagged++;
// FIXME: can be smarter here
- if (names.length==p.count) {
- int[] ret = new int[p.count];
- for(int i=0; i<p.count; i++) ret[i] = i;
- return ret;
- } else if (argTagged==p.count) {
+ if (argTagged==p.count) {
int[] ret = new int[argtags.length];
int j = 0;
- for(int i=0; i<argtags.length; i++)
- ret[i] = argtags[i]==null ? -1 : (j++);
+ for(int i=0; i<argtags.length; i++) {
+ if (argtags[i]==null) continue;
+ if (argtags[i].value().equals(""))
+ ret[i] = j++;
+ else {
+ ret[i] = -1;
+ for(int k=0; k<names.length; k++)
+ if (argtags[i].value().equals(names[k])){
+ ret[i] = k;
+ break;
+ }
+ if (ret[i]==-1) return null;
+ }
+ }
+ return ret;
+ } else if (names.length==p.count) {
+ int[] ret = new int[p.count];
+ for(int i=0; i<p.count; i++) ret[i] = i;
return ret;
} else {
return null;
ret.add(null);
}
}
- System.err.println("input tree: " + t);
+ //System.err.println("input tree: " + t);
Object[] o = (Object[])ret.toArray(new Object[0]);
int max = 0;
for(int i=0; i<map.length; i++) max = Math.max(map[i], max);
}
public static Union make(Tree t, String s) { return make(t, s, new AnnotationGrammarBindingResolver()); }
public static Union make(Tree t, String s, GrammarBindingResolver rm) {
- System.out.println("Head: " + t.head());
Tree.TreeFunctor<Object,Object> red = (Tree.TreeFunctor<Object,Object>)t.head();
MetaGrammarBindings.Grammar g = (MetaGrammarBindings.Grammar)red.invoke(t.children());
Context cx = new Context(g,rm);
Union u = null;
- for(MetaGrammarBindings.NonTerminal nt : g.nonterminals) {
- System.out.println(nt.name);
+ for(MetaGrammarBindings.NonTerminal nt : g.values()) {
Union el = (Union)cx.get(nt.name);
StringBuffer st = new StringBuffer();
el.toString(st);
- System.err.println(st);
if (nt.name.equals(s)) u = el;
}
return u;
}
public Union build() {
Union ret = null;
- for(MetaGrammarBindings.NonTerminal nt : grammar.nonterminals) {
+ for(MetaGrammarBindings.NonTerminal nt : grammar.values()) {
Union u = get(nt.name);
if ("s".equals(nt.name))
ret = u;