X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;ds=inline;f=src%2Fedu%2Fberkeley%2Fsbp%2Fmeta%2FGrammarAST.java;h=ceb126a0561a331ba7c102c11e78675d76be897f;hb=f83d82d0feb59c8416bfaff6f2fd3eff61449520;hp=87f7789269cabbfdc1a2a102567439de866a140a;hpb=67d5def8fede01f412905fb5ff968b79894166fb;p=sbp.git
diff --git a/src/edu/berkeley/sbp/meta/GrammarAST.java b/src/edu/berkeley/sbp/meta/GrammarAST.java
index 87f7789..ceb126a 100644
--- a/src/edu/berkeley/sbp/meta/GrammarAST.java
+++ b/src/edu/berkeley/sbp/meta/GrammarAST.java
@@ -16,6 +16,18 @@ import java.io.*;
*/
public class GrammarAST {
+ public static interface ImportResolver {
+ public InputStream getImportStream(String importname);
+ }
+
+ /**
+ * Returns a Union representing the metagrammar (meta.g); the Tree produced by
+ * parsing with this Union should be provided to buildFromAST
+ */
+ public static Union getMetaGrammar() {
+ return buildFromAST(MetaGrammar.meta, "s", null);
+ }
+
/**
* Create a grammar from a parse tree and binding resolver
*
@@ -23,12 +35,8 @@ public class GrammarAST {
* @param s the name of the "start symbol"
* @param gbr a GrammarBindingResolver that resolves grammatical reductions into tree-node-heads
*/
- public static Union buildFromAST(Tree grammarAST, String startingNonterminal, File[] includes) {
- return new GrammarAST(includes, "").buildGrammar(grammarAST, startingNonterminal);
- }
-
- public static Union getMetaGrammar() {
- return MetaGrammar.newInstance();
+ public static Union buildFromAST(Tree grammarAST, String startingNonterminal, ImportResolver resolver) {
+ return new GrammarAST(resolver, "").buildGrammar(grammarAST, startingNonterminal);
}
private static Object illegalTag = ""; // this is the tag that should never appear in the non-dropped output FIXME
@@ -36,11 +44,11 @@ public class GrammarAST {
// Instance //////////////////////////////////////////////////////////////////////////////
private final String prefix;
- private final File[] includes;
+ private final ImportResolver resolver;
- public GrammarAST(File[] includes, String prefix) {
+ public GrammarAST(ImportResolver resolver, String prefix) {
this.prefix = prefix;
- this.includes = includes;
+ this.resolver = resolver;
}
// Methods //////////////////////////////////////////////////////////////////////////////
@@ -88,7 +96,6 @@ public class GrammarAST {
if (head.equals("Elements")) return new Seq((ElementNode[])Reflection.rebuild(walkChildren(t), ElementNode[].class));
if (head.equals("NonTerminalReference")) return new ReferenceNode(stringifyChildren(t.child(0)));
if (head.equals(")")) return new ReferenceNode(stringifyChildren(t.child(0)), true);
- if (head.equals("{")) return new BracedNode(walkSeq(t.child(0)));
if (head.equals("::")) return walkSeq(t.child(1)).tag(walkString(t.child(0)));
if (head.equals("...")) return new DropNode(new RepeatNode(new TildeNode(new AtomNode()), null, true, true, false));
@@ -104,15 +111,15 @@ public class GrammarAST {
if (head.equals("!")) return new DropNode(walkElement(t.child(0)));
if (head.equals("^")) return new LiteralNode(walkString(t.child(0)), true);
- if (head.equals("`")) return walkElement(t.child(0)).lifted();
+ if (head.equals("`")) return new BacktickNode(walkElement(t.child(0)));
if (head.equals("Quoted")) return stringifyChildren(t);
if (head.equals("Literal")) return new LiteralNode(walkString(t.child(0)));
if (head.equals("->")) return walkSeq(t.child(0)).follow(walkElement(t.child(1)));
if (head.equals("DropNT")) return new NonTerminalNode(walkString(t.child(0)), (Seq[][])walkChildren(t.child(1)), false, null, true);
if (head.equals("=")) return new NonTerminalNode(walkString(t.child(0)), (Seq[][])walk(t.child(2)),
true, t.size()==2 ? null : walkString(t.child(1)), false);
- if (head.equals("&")) return and2(walkSeq(t.child(0)), walkSeq(t.child(1)));
- if (head.equals("&~")) return andnot2(walkSeq(t.child(0)), walkSeq(t.child(1)));
+ if (head.equals("&")) return walkSeq(t.child(0)).and(walkSeq(t.child(1)));
+ if (head.equals("&~")) return walkSeq(t.child(0)).andnot(walkSeq(t.child(1)));
if (head.equals("/")) return (walkSeq(t.child(0))).separate(walkElement(t.child(1)));
if (head.equals("()")) return new LiteralNode("");
if (head.equals("[")) return new AtomNode((char[][])Reflection.rebuild(walkChildren(t), char[][].class));
@@ -131,7 +138,7 @@ public class GrammarAST {
if (head.equals("\"\"")) return "";
if (head.equals("\n")) return "\n";
if (head.equals("\r")) return "\r";
- if (head.equals("SubGrammar")) return GrammarAST.buildFromAST(t.child(0), "s", includes);
+ if (head.equals("SubGrammar")) return GrammarAST.buildFromAST(t.child(0), "s", resolver);
if (head.equals("NonTerminal"))
return new NonTerminalNode(walkString(t.child(0)),
(Seq[][])walkChildren(t.child(1)), false, null, false);
@@ -144,20 +151,21 @@ public class GrammarAST {
return new NonTerminalNode(tag, seqs, false, null, false);
}
if (head.equals("#import")) {
- String fileName = (String)stringifyChildren(t.child(0));
- for(File f : includes) {
- File file = new File(f.getAbsolutePath()+File.separatorChar+fileName);
- if (!file.exists()) continue;
+ if (resolver != null) {
+ String fileName = (String)stringifyChildren(t.child(0));
try {
String newPrefix = t.size()<2 ? "" : (walkString(t.child(1))+".");
- FileInputStream fis = new FileInputStream(file);
- Tree tr = new CharParser(MetaGrammar.newInstance()).parse(fis).expand1();
- return (GrammarNode)new GrammarAST(includes, newPrefix).walk(tr);
+ InputStream fis = resolver.getImportStream(fileName);
+ if (fis==null)
+ throw new RuntimeException("unable to find #include file \""+fileName+"\"");
+ Tree tr = new CharParser(getMetaGrammar()).parse(fis).expand1();
+ return (GrammarNode)new GrammarAST(resolver, newPrefix).walk(tr);
} catch (Exception e) {
- throw new RuntimeException("while parsing " + file, e);
+ throw new RuntimeException("while parsing " + fileName, e);
}
+ } else {
+ throw new RuntimeException("no resolver given");
}
- throw new RuntimeException("unable to find #include file \""+fileName+"\"");
}
throw new RuntimeException("unknown head: \"" + head + "\" => " + (head.equals("...")));
}
@@ -204,6 +212,14 @@ public class GrammarAST {
}
}
+ /** a node in the AST which is resolved into an Element */
+ private abstract class ElementNode {
+ public boolean isLifted() { return false; }
+ public boolean isDropped(Context cx) { return false; }
+ public Atom toAtom(Context cx) { throw new Error("can't convert a " + this.getClass().getName() + " to an atom: " + this); }
+ public abstract Element build(Context cx, NonTerminalNode cnt, boolean dropall);
+ }
+
private class UnionNode extends ElementNode {
public Seq[][] sequences;
public String sep = null;
@@ -215,10 +231,10 @@ public class GrammarAST {
this.rep = rep;
this.sep = sep;
}
- public boolean drop(Context cx) {
+ public boolean isDropped(Context cx) {
for(Seq[] seqs : sequences)
for(Seq seq : seqs)
- if (!seq.drop(cx))
+ if (!seq.isDropped(cx))
return false;
return true;
}
@@ -270,7 +286,7 @@ public class GrammarAST {
private class NonTerminalNode extends UnionNode {
public boolean alwaysDrop;
public String name = null;
- public boolean drop(Context cx) { return alwaysDrop; }
+ public boolean isDropped(Context cx) { return alwaysDrop; }
public NonTerminalNode(String name, Seq[][] sequences, boolean rep, String sep, boolean alwaysDrop) {
super(sequences, rep, sep==null?null:(prefix + sep));
this.name = prefix + name;
@@ -281,11 +297,11 @@ public class GrammarAST {
private class Seq {
public boolean alwaysDrop = false;
- public boolean drop(Context cx) {
+ public boolean isDropped(Context cx) {
if (alwaysDrop) return true;
if (tag!=null) return false;
for(int i=0; i)_e.toAtom(cx).complement()); }
@@ -513,29 +520,9 @@ public class GrammarAST {
private class DropNode extends ElementNodeWrapper {
public DropNode(ElementNode e) { super(e); }
- public boolean drop(Context cx) { return true; }
+ public boolean isDropped(Context cx) { return true; }
}
- // FIXME: doesn't this require a tag?
- private class BracedNode extends ElementNode {
- public Seq body;
- public BracedNode(Seq seq) { this.body = seq; }
- public Element build(Context cx, NonTerminalNode cnt, boolean dropall) {
- Union u = new Union(null, false);
- Sequence s = body.build(cx, u, null, dropall);
- Union u2 = new Union(null, false);
- u2.add(Sequence.create(new Element[] {
- CharAtom.leftBrace,
- u,
- CharAtom.rightBrace
- }, 1));
- return u2;
- }
- }
-
- public Seq and2(Seq s, Seq a) { a.alwaysDrop = true; return s.and(a); }
- public Seq andnot2(Seq s, Seq a) { a.alwaysDrop = true; return s.andnot(a); }
-
//////////////////////////////////////////////////////////////////////////////
public class Context {
@@ -563,7 +550,7 @@ public class GrammarAST {
} else {
ret = new Union(name, false);
map.put(name, ret);
- nt.buildIntoPreallocatedUnion(this, nt, nt.drop(this), ret);
+ nt.buildIntoPreallocatedUnion(this, nt, nt.isDropped(this), ret);
}
return ret;
}