| Package | Description |
|---|---|
| com.articulate.sigma.semRewrite |
| Modifier and Type | Method and Description |
|---|---|
static Rule |
Rule.parse(Lexer lex)
We won't know whether it's a fact or a rule until we read the
first token, so the first token for LHS will always be already
in st.sval
|
RuleSet |
RuleSet.parse(Lexer lex) |
static Literal |
Literal.parse(Lexer lex,
int startLine) |
static RHS |
RHS.parse(Lexer lex,
int startLine)
The predicate must already have been read
|
static LHS |
LHS.parse(Lexer lex,
int startLine) |
static CNF |
CNF.parseSimple(Lexer lex)
Only positive clauses, no disjuncts, which is the output format
of the Stanford Dependency Parser
|