Instances are decision network searchers that can load an ASDGrammar
from a specified file and use it as a decision network.on an input
string of decision tokens treated as an unordered set.
Initializes an instance with the ASDDecider itself to
interpret semantic actions and semantic values in the grammar,
and with application-specific messages to be sent to the
specified application, if desired.
Initializes an ASDDecider instance with a reference to a given
application to which application-specific messages are to be sent,
and a given instance of a class that implements the ASDSemantics
interface.
This provides a self-standing optimizer for ASD grammars,
taking input from a grammar in its character file representation
and writing the optimized grammar to a new character file.
Initializes an instance with the ASDParser itself to
interpret semantic actions and semantic values in the grammar,
and with application-specific messages to be sent to the
specified application.
Initializes an ASDParser instance with a reference to a given
application to which application-specific messages are to be sent,
and a given instance of a class that implements the ASDSemantics
interface.
Attempts to backtrack the search state to the most recent
place where a local ambiguity occurred -- that is, where
there was more than one choice for advancing.
Attempts to backtrack the parse state to the most recent
place where a local ambiguity occurred -- that is, where
there was more than one choice for advancing.
Returns a list of strings that name the phrase types
that can begin, directly or indirectly, at the node
(if it is an initial node);
returns null if the node is not initial or if the
phrase types that it can begin are not known
specifically.
Adds to the HashSet aSet all DigraphNodes that are NOT already
in aSet but from which the receiver is reachable by traversal of
one or more edges without regard to edge direction.
Merges grammars in files whose names are listed second through last
in lines from System.in and writes the result to the file whose name
is listed in the first line from System.in.
Copies the feature-value pairs from the current node value
(which must be a Map) to the current top level of the phrase
structure being searched, provided they are compatible with feature
values already assigned.
Copies the feature-value pairs from the current node value
(which must be a Map) to the current top level of the phrase
structure being parsed, provided they are compatible with feature
values already assigned.
Evaluates a string from a "semantic value" field in an
ASDGrammar, as a long integer number, a quoted string, or
by invoking the method of the application object which
is named by the semantic value field.
Evaluates a string from a "semantic value" field in an
ASDGrammar, as a long integer number, a quoted string, or
by invoking the method of the application object which
is named by the semantic value field.
Attempts to find next search of current decision structure
in a specified maximum number of advance steps;
displays the decision structure to System.out after each step.
Attempts to find next parse of current phrase structure
in a specified maximum number of advance steps;
displays the parse tree to System.out after each step.
Returns a list of successor instances of the node,
if it is not a final node in the grammar (each
successor instance is represented by an
ASDGrammarSuccessor instance);
returns null if the node is a final node.
Returns a list of Strings that name the phrase
types that occur in successors of the node, if
it is not a final node; returns null if the node
has some unspecified phrase types in successors,
or if the node is a final node.
Returns a String that represents an ASDGrammarNode in character
form, as used for the representation of a word instance in the
character file representation of an ASD grammar.
Returns a string that represents the Digraph in the following
form:
- the number of nodes in digraphNodes;
- a parenthesized list of edge representations,
each a parenthesized pair: (fromNodeNumber, toNodeNumber)
where fromNodeNumber and toNodeNumber are indices of nodes
in digraphNodes.