de.uni_tuebingen.sfb.lichtenstein.binarytrees
Interface FormulaParser

All Known Implementing Classes:

LispToMonaParser

public interface FormulaParser

A class to parse a formula given by the user.

Author:

Hendrik Maryns

Field Summary

static String	CATEGORY The symbol for the category of a node.
static String	CONJUNCTION The symbol for conjunction of two formulas.
static String	CONTAINMENT The symbol for containment of a node in a set.
static String	DISJUNCTION The symbol for disjunction of two formulas.
static String	DOMINANCE The symbol for dominance of two nodes.
static String	EQUALITY The symbol for equality of two nodes.
static String	FIRST_ORDER_EXISTENTIAL The symbol for existential quantification over a node of a formula.
static String	FIRST_ORDER_UNIVERSAL The symbol for universal quantification over a node of a formula.
static String	FUNCTION The symbol for the function of a node.
static String	IMMEDIATE_DOMINANCE The symbol for immediate dominance of two nodes.
static String	IMMEDIATE_PRECEDENCE The symbol for immediate precedence of two nodes.
static String	IMPLICATION The symbol for implication of two formulas.
static String	LEMMA The symbol for the lemma of a node.
static String	MORPHOLOGY The symbol for the morphology of a node.
static String	NEGATION The symbol for negation of a formula.
static String	PRECEDENCE The symbol for precedence of two nodes.
static String	PROPER_DOMINANCE The symbol for proper dominance of two nodes.
static String	SECOND_ORDER_EXISTENTIAL The symbol for existential quantification over a set of a formula.
static String	SECOND_ORDER_UNIVERSAL The symbol for universal quantification over a set of a formula.
static String	SENTENCE The symbol for the sentence of the tree, as a regular expression.
static String	WORD The symbol for the token of a node.

Method Summary

String

parse() Parse the formula.

Field Detail

SECOND_ORDER_UNIVERSAL

static final String SECOND_ORDER_UNIVERSAL

The symbol for universal quantification over a set of a formula.

See Also:

Constant Field Values

SECOND_ORDER_EXISTENTIAL

static final String SECOND_ORDER_EXISTENTIAL

The symbol for existential quantification over a set of a formula.

See Also:

Constant Field Values

FIRST_ORDER_UNIVERSAL

static final String FIRST_ORDER_UNIVERSAL

The symbol for universal quantification over a node of a formula.

See Also:

Constant Field Values

FIRST_ORDER_EXISTENTIAL

static final String FIRST_ORDER_EXISTENTIAL

The symbol for existential quantification over a node of a formula.

See Also:

Constant Field Values

IMPLICATION

static final String IMPLICATION

The symbol for implication of two formulas.

See Also:

Constant Field Values

DISJUNCTION

static final String DISJUNCTION

The symbol for disjunction of two formulas.

See Also:

Constant Field Values

CONJUNCTION

static final String CONJUNCTION

The symbol for conjunction of two formulas.

See Also:

Constant Field Values

NEGATION

static final String NEGATION

The symbol for negation of a formula.

See Also:

Constant Field Values

CONTAINMENT

static final String CONTAINMENT

The symbol for containment of a node in a set.

See Also:

Constant Field Values

EQUALITY

static final String EQUALITY

The symbol for equality of two nodes.

See Also:

Constant Field Values

PROPER_DOMINANCE

static final String PROPER_DOMINANCE

The symbol for proper dominance of two nodes.

See Also:

Constant Field Values

IMMEDIATE_DOMINANCE

static final String IMMEDIATE_DOMINANCE

The symbol for immediate dominance of two nodes.

See Also:

Constant Field Values

DOMINANCE

static final String DOMINANCE

The symbol for dominance of two nodes.

See Also:

Constant Field Values

IMMEDIATE_PRECEDENCE

static final String IMMEDIATE_PRECEDENCE

The symbol for immediate precedence of two nodes.

See Also:

Constant Field Values

PRECEDENCE

static final String PRECEDENCE

The symbol for precedence of two nodes.

See Also:

Constant Field Values

FUNCTION

static final String FUNCTION

The symbol for the function of a node.

See Also:

Constant Field Values

CATEGORY

static final String CATEGORY

The symbol for the category of a node.

See Also:

Constant Field Values

WORD

static final String WORD

The symbol for the token of a node.

See Also:

Constant Field Values

LEMMA

static final String LEMMA

The symbol for the lemma of a node.

See Also:

Constant Field Values

MORPHOLOGY

static final String MORPHOLOGY

The symbol for the morphology of a node.

See Also:

Constant Field Values

SENTENCE

static final String SENTENCE

The symbol for the sentence of the tree, as a regular expression.

See Also:

Constant Field Values

Method Detail

parse

String parse()
             throws LispFormulaParseException

Parse the formula.

Returns:

A string representing the formula. TODO: which return type? Make it void and with parameter?

Throws:

LispFormulaParseException - [CAN] If the formula has an incorrect syntax.