tags

myMaxLength

numStates

arraySize

constraints

When you want to force the parser to parse a particular
subsequence into a particular state. Parses will only be made
where there is a constituent over the given span which matches
(as regular expression) the state Pattern given. See the
documentation of the ParserConstraint class for information on
specifying a ParserConstraint.
Implementation note: It would be cleaner to make this a
Collections.emptyList, but that actually significantly slows down
the processing in the case of empty lists. Checking for null
saves quite a bit of time.

tick

parse

Parses the given sentence. For any words in the sentence which
implement HasTag, the tag will be believed. The return value
will be false if the sentence is not parseable. Acceptance is with
respect to some goal category, which may be specified by the grammar,
or may be a parser default (for instance, S).

extractBestParses

Return all best parses (except no ties allowed on POS tags?).
Even though we parse with the unary-closed grammar, since all the
intermediate states in a chain must have been built, we can
reconstruct the unary chain as we go using the non-unary-closed grammar.