Package org.jparsec
package org.jparsec
Provides core Parser implementations for parser combinator logic.
Parser and Parsers are the 2 core classes in this package. Convenience API such as invalid input: '<'a href="Terminals.html>Terminals and OperatorTable are also provided.
Parser and Parsers are the 2 core classes in this package. Convenience API such as invalid input: '<'a href="Terminals.html>Terminals and OperatorTable are also provided.
Package Specification
The code is developed and tested under Java 5.0.Related Documentation
For overviews, tutorials, examples, guides, and tool documentation, please check out CodeHaus-
ClassDescriptionBestParser<T>Parses a list of pattern started with a delimiter, separated and optionally ended by the delimiter.A parser that always returns an empty mutable list.Empty implementation of
ParseErrorDetails
for subclasses to override.Processes indentation based lexical structure according to the Off-side rule.Functors used only internally by this package.Maps two integers to a boolean value.Helper class for creating lexers and parsers for keywords.ALexicon
is a group of lexical words that can be tokenized by a single tokenizer.ListFactory<T>Creates a {link List}.Parses any nestable comment pattern.Transforms the recognized character range to an integer within 64 bits.Helper class for creating parsers and lexers for operators.A suite is a list of overlapping operators, where some operators are prefixes of other operators.A list of suites in the reverse order of the suites.BuildsParser
to parse expressions with operator-precedence grammar.Describes operator associativity, in order of precedence.Represents the context state during parsing.Allows tracing of parsing progress during error condition, to ease debugging.Parser<T>Defines grammar and encapsulates parsing logic.Defines the mode that a parser should be run in.An atomic mutable reference toParser
used in recursive grammars.Parser.Rhs<T>Provides commonParser
implementations.RepresentsParseContext
for token level parsing.Represents the syntactical structure of the input being parsed.Deprecated.Provides commonParser
implementations that scan the source and match certain string patterns.Parser state for scanner.Represents a location inside the source.Locates the line and column number of a 0-based index in the source.Translates the recognized string literal to aString
.Provides convenient API to build lexer and parsers for terminals.Entry point for parser and tokenizers of character literal.Entry point for parser and tokenizers of decimal number literal represented asString
.Entry point for parser and tokenizers of regular identifier.Entry point for any arbitrary integer literal represented as aString
.Entry point for parser and tokenizers of integral number literal represented asLong
.Entry point for parser and tokenizers of scientific notation literal.Entry point for parser and tokenizers of string literal.Represents any token with a token value and the 0-based index in the source.TokenMap<T>Maps aToken
to a an object of typeT
, or null if the token isn't recognized.Provides common token values.Represents a fragment tagged according to its semantics.Represents a scientific notation with a significand (mantissa) and an exponent.Pre-builtTokens.Fragment
token tags.A TreeNode remembers it's parent (which corresponds to a parent parser that syntactically encloses this parter), it's previous node (which is the parser at the same syntactical level and had just succeeded before this parser started).WithSource<T>Parsed result with the matched source text.