Leonardo
0.0.0+1-f7ef5ec1-SNAPSHOT
API
Generated with
Leonardo/it.grypho.scala.leonardo/it.grypho.scala.leonardo.parser/Parser

Parser

it.grypho.scala.leonardo.parser.Parser
object Parser extends JavaTokenParsers

Recursive-descent parser for Leonardo mathematical expressions.

All grammar productions are lazy val so the combinator graph and compiled regexes are built once on first access and reused for every subsequent parse call. Only guardedExpr and guardedSignedPower remain def because they capture per-call depth state via a ThreadLocal counter.

Grammar summary:

topLevel     ::= logicExpr
logicExpr    ::= implExpr                    -- boolean connectives bind loosest
implExpr     ::= orExpr ["implies" implExpr] -- right-associative, loosest connective
orExpr       ::= xorExpr ("or" xorExpr)*
xorExpr      ::= andExpr ("xor" andExpr)*
andExpr      ::= notExpr ("and" notExpr)*
notExpr      ::= "not" notExpr | equationExpr | "(" logicExpr ")"
equationExpr ::= expr [("==" | "=") expr]   -- "==" -> _EqualityCheck; "=" -> _Equation
expr         ::= ["+" | "-"] simpleExpr
simpleExpr   ::= term (("+" | "-") term)*
term         ::= signedPower (("*" | "/") signedPower | "" power)*
signedPower  ::= ["+" | "-"] power
power        ::= factor ["^" signedPower]    -- right-associative
factor       ::= function | functional | matrix | value | "(" equationExpr ")"
matrix       ::= "[" matrixRow ("," matrixRow)* "]"
matrixRow    ::= "[" equationExpr ("," equationExpr)* "]"

Sign handling: the number token is unsigned so that implicit multiplication does not swallow 3-2 as 3 * (-2). A sign is allowed where an explicit operator precedes (start of expression, after +, -, *, /, ^, and in integral limits) but deliberately not in the operand of implicit *.

Matrix dispatch: when a syntactically visible matrix operand appears, +/-/* build MatSum/MatProduct/MatScale rather than Sum/Product. M * y with a non-literal y builds MatProduct(M, y) (not MatScale(y, M)) because y may be a variable bound to a matrix at eval time, and swapping would silently commute the product. Only a literal _Number right operand is known to commute.

Nesting guard: a ThreadLocal depth counter is incremented at every parenthesised sub-expression and at every ^ exponent; the parser returns a failure rather than blowing the JVM stack when the depth reaches MaxDepth.

Attributes

Graph
Supertypes
trait JavaTokenParsers
trait RegexParsers
trait Parsers
class Object
trait Matchable
class Any
Show all
Self type
Parser.type

Members list

Type members

Inherited classlikes

case class Error(msg: String, next: Input) extends NoSuccess

The fatal failure case of ParseResult: contains an error-message and the remaining input. No back-tracking is done when a parser returns an Error.

The fatal failure case of ParseResult: contains an error-message and the remaining input. No back-tracking is done when a parser returns an Error.

Value parameters

msg

An error message string describing the error.

next

The parser's unconsumed input at the point where the error occurred.

Attributes

Inherited from:
Parsers
Supertypes
trait Serializable
trait Product
trait Equals
class NoSuccess
class ParseResult[Nothing]
class Object
trait Matchable
class Any
Show all
case class Failure(msg: String, next: Input) extends NoSuccess

The failure case of ParseResult: contains an error-message and the remaining input. Parsing will back-track when a failure occurs.

The failure case of ParseResult: contains an error-message and the remaining input. Parsing will back-track when a failure occurs.

Value parameters

msg

An error message string describing the failure.

next

The parser's unconsumed input at the point where the failure occurred.

Attributes

Inherited from:
Parsers
Supertypes
trait Serializable
trait Product
trait Equals
class NoSuccess
class ParseResult[Nothing]
class Object
trait Matchable
class Any
Show all
object NoSuccess

An extractor so case NoSuccess(msg, next) can be used in matches.

An extractor so case NoSuccess(msg, next) can be used in matches.

Note: On Scala 2.13, using this extractor leads to an exhaustivity warning:

 def m(r: ParseResult[Int]) = r match {
   case Success(i) => ...
   case NoSuccess(msg, _) => ... // "warning: match may not be exhaustive"

To eliminate this warning, use the irrefutable NoSuccess.I extractor. Due to binary compatibility, NoSuccess itself cannot be changed.

Attributes

Inherited from:
Parsers
Supertypes
trait Sum
trait Mirror
class Object
trait Matchable
class Any
trait OnceParser[+T] extends Parser[T]

A parser whose ~ combinator disallows back-tracking.

A parser whose ~ combinator disallows back-tracking.

Attributes

Inherited from:
Parsers
Supertypes
class Parser[T]
trait Input => ParseResult[T]
class Object
trait Matchable
class Any
case class Success[+T](result: T, next: Input) extends ParseResult[T]

The success case of ParseResult: contains the result and the remaining input.

The success case of ParseResult: contains the result and the remaining input.

Value parameters

next

The parser's remaining input

result

The parser's output

Attributes

Inherited from:
Parsers
Supertypes
trait Serializable
trait Product
trait Equals
class ParseResult[T]
class Object
trait Matchable
class Any
Show all
case class ~[+a, +b](_1: a, _2: b)

A wrapper over sequence of matches.

A wrapper over sequence of matches.

Given p1: Parser[A] and p2: Parser[B], a parser composed with p1 ~ p2 will have type Parser[~[A, B]]. The successful result of the parser can be extracted from this case class.

It also enables pattern matching, so something like this is possible:

def concat(p1: Parser[String], p2: Parser[String]): Parser[String] =
  p1 ~ p2 ^^ { case a ~ b => a + b }

Attributes

Inherited from:
Parsers
Supertypes
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any
Show all

Inherited and Abstract classlikes

sealed abstract class NoSuccess(val msg: String, val next: Input) extends ParseResult[Nothing]

A common super-class for unsuccessful parse results.

A common super-class for unsuccessful parse results.

Attributes

Inherited from:
Parsers
Supertypes
class ParseResult[Nothing]
class Object
trait Matchable
class Any
Known subtypes
class Error
class Failure
sealed abstract class ParseResult[+T]

A base class for parser results. A result is either successful or not (failure may be fatal, i.e., an Error, or not, i.e., a Failure). On success, provides a result of type T which consists of some result (and the rest of the input).

A base class for parser results. A result is either successful or not (failure may be fatal, i.e., an Error, or not, i.e., a Failure). On success, provides a result of type T which consists of some result (and the rest of the input).

Attributes

Inherited from:
Parsers
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class NoSuccess
class Error
class Failure
class Success[T]
abstract class Parser[+T] extends Input => ParseResult[T]

The root class of parsers. Parsers are functions from the Input type to ParseResult.

The root class of parsers. Parsers are functions from the Input type to ParseResult.

Attributes

Inherited from:
Parsers
Supertypes
trait Input => ParseResult[T]
class Object
trait Matchable
class Any
Known subtypes
trait OnceParser[T]

Inherited types

type Elem = Char

the type of input elements the provided parsers consume (When consuming invidual characters, a parser is typically called a ''scanner'', which produces ''tokens'' that are consumed by what is normally called a ''parser''. Nonetheless, the same principles apply, regardless of the input type.)

the type of input elements the provided parsers consume (When consuming invidual characters, a parser is typically called a ''scanner'', which produces ''tokens'' that are consumed by what is normally called a ''parser''. Nonetheless, the same principles apply, regardless of the input type.)

Attributes

Inherited from:
RegexParsers
type Input = Reader[Elem]

The parser input is an abstract reader of input elements, i.e. the type of input the parsers in this component expect.

The parser input is an abstract reader of input elements, i.e. the type of input the parsers in this component expect.

Attributes

Inherited from:
Parsers

Value members

Concrete methods

def parse(str: String, exact: Option[Int]): ParseResult[_Expression]

Parses str and returns a ParseResult containing the AST or an error message.

Parses str and returns a ParseResult containing the AST or an error message.

Value parameters

exact

Some(digits) builds exact literals (core._Rational) and approximates the irrational constants to that working precision; None, the default, is the unchanged Double path. Passed explicitly rather than read from an Environment, mirroring logic.simplifyLogic's symmetric and semantics parameters — the parser predates any environment and has no business depending on one.

str

the input string to parse

Attributes

Returns

Success(expr) on success, or Failure/Error with a description

Inherited methods

def OnceParser[T](f: Input => ParseResult[T]): Parser[T] & OnceParser[T]

Attributes

Inherited from:
Parsers
def Parser[T](f: Input => ParseResult[T]): Parser[T]

Attributes

Inherited from:
Parsers
def accept[U](expected: String, f: PartialFunction[Elem, U]): Parser[U]

The parser that matches an element in the domain of the partial function f.

The parser that matches an element in the domain of the partial function f.

If f is defined on the first element in the input, f is applied to it to produce this parser's result.

Example: The parser accept("name", {case Identifier(n) => Name(n)}) accepts an Identifier(n) and returns a Name(n)

Value parameters

expected

a description of the kind of element this parser expects (for error messages)

f

a partial function that determines when this parser is successful and what its output is

Attributes

Returns

A parser that succeeds if f is applicable to the first element of the input, applying f to it to produce the result.

Inherited from:
Parsers
def accept[ES](es: ES)(implicit f: ES => List[Elem]): Parser[List[Elem]]

A parser that matches only the given list of element es.

A parser that matches only the given list of element es.

accept(es) succeeds if the input subsequently provides the elements in the list es.

Value parameters

es

the list of expected elements

Attributes

Returns

a Parser that recognizes a specified list of elements

Inherited from:
Parsers
def acceptIf(p: Elem => Boolean)(err: Elem => String): Parser[Elem]

A parser matching input elements that satisfy a given predicate.

A parser matching input elements that satisfy a given predicate.

acceptIf(p)(el => "Unexpected "+el) succeeds if the input starts with an element e for which p(e) is true.

Value parameters

err

A function from the received element into an error message.

p

A predicate that determines which elements match.

Attributes

Returns

A parser for elements satisfying p(e).

Inherited from:
Parsers
def acceptMatch[U](expected: String, f: PartialFunction[Elem, U]): Parser[U]

The parser that matches an element in the domain of the partial function f.

The parser that matches an element in the domain of the partial function f.

If f is defined on the first element in the input, f is applied to it to produce this parser's result.

Example: The parser acceptMatch("name", {case Identifier(n) => Name(n)}) accepts an Identifier(n) and returns a Name(n)

Value parameters

expected

a description of the kind of element this parser expects (for error messages)

f

a partial function that determines when this parser is successful and what its output is

Attributes

Returns

A parser that succeeds if f is applicable to the first element of the input, applying f to it to produce the result.

Inherited from:
Parsers
def acceptSeq[ES](es: ES)(implicit f: ES => Iterable[Elem]): Parser[List[Elem]]

A parser that matches only the given scala.collection.Iterable collection of elements es.

A parser that matches only the given scala.collection.Iterable collection of elements es.

acceptSeq(es) succeeds if the input subsequently provides the elements in the iterable es.

Value parameters

es

the list of expected elements

Attributes

Returns

a Parser that recognizes a specified list of elements

Inherited from:
Parsers
def chainl1[T, U](first: => Parser[T], p: => Parser[U], q: => Parser[(T, U) => T]): Parser[T]

A parser generator that, roughly, generalises the rep1sep generator so that q, which parses the separator, produces a left-associative function that combines the elements it separates.

A parser generator that, roughly, generalises the rep1sep generator so that q, which parses the separator, produces a left-associative function that combines the elements it separates.

Value parameters

first

a parser that parses the first element

p

a parser that parses the subsequent elements

q

a parser that parses the token(s) separating the elements, yielding a left-associative function that combines two elements into one

Attributes

Inherited from:
Parsers
def chainl1[T](p: => Parser[T], q: => Parser[(T, T) => T]): Parser[T]

A parser generator that, roughly, generalises the rep1sep generator so that q, which parses the separator, produces a left-associative function that combines the elements it separates.

A parser generator that, roughly, generalises the rep1sep generator so that q, which parses the separator, produces a left-associative function that combines the elements it separates.

''From: J. Fokker. Functional parsers. In J. Jeuring and E. Meijer, editors, Advanced Functional Programming, volume 925 of Lecture Notes in Computer Science, pages 1--23. Springer, 1995.''

Value parameters

p

a parser that parses the elements

q

a parser that parses the token(s) separating the elements, yielding a left-associative function that combines two elements into one

Attributes

Inherited from:
Parsers
def chainr1[T, U](p: => Parser[T], q: => Parser[(T, U) => U], combine: (T, U) => U, first: U): Parser[U]

A parser generator that generalises the rep1sep generator so that q, which parses the separator, produces a right-associative function that combines the elements it separates. Additionally, the right-most (last) element and the left-most combining function have to be supplied.

A parser generator that generalises the rep1sep generator so that q, which parses the separator, produces a right-associative function that combines the elements it separates. Additionally, the right-most (last) element and the left-most combining function have to be supplied.

rep1sep(p: Parser[T], q) corresponds to chainr1(p, q ^^ cons, cons, Nil) (where val cons = (x: T, y: List[T]) => x :: y)

Value parameters

combine

the "last" (left-most) combination function to be applied

first

the "first" (right-most) element to be combined

p

a parser that parses the elements

q

a parser that parses the token(s) separating the elements, yielding a right-associative function that combines two elements into one

Attributes

Inherited from:
Parsers
def commit[T](p: => Parser[T]): Parser[T]

Wrap a parser so that its failures become errors (the | combinator will give up as soon as it encounters an error, on failure it simply tries the next alternative).

Wrap a parser so that its failures become errors (the | combinator will give up as soon as it encounters an error, on failure it simply tries the next alternative).

Attributes

Inherited from:
Parsers
def decimalNumber: Parser[String]

Number following one of these rules:

Number following one of these rules:

  • An integer. For example: 13
  • An integer followed by a decimal point. For example: 3.
  • An integer followed by a decimal point and fractional part. For example: 3.14
  • A decimal point followed by a fractional part. For example: .1

Attributes

Inherited from:
JavaTokenParsers
def elem(e: Elem): Parser[Elem]

A parser that matches only the given element e.

A parser that matches only the given element e.

elem(e) succeeds if the input starts with an element e.

Value parameters

e

the Elem that must be the next piece of input for the returned parser to succeed

Attributes

Returns

a Parser that succeeds if e is the next available input (and returns it).

Inherited from:
Parsers
def elem(kind: String, p: Elem => Boolean): Parser[Elem]

A parser matching input elements that satisfy a given predicate.

A parser matching input elements that satisfy a given predicate.

elem(kind, p) succeeds if the input starts with an element e for which p(e) is true.

Value parameters

kind

The element kind, used for error messages

p

A predicate that determines which elements match.

Attributes

Inherited from:
Parsers
override def err(msg: String): Parser[Nothing]

A parser that results in an error.

A parser that results in an error.

This parser additionally skips whitespace if skipWhitespace returns true.

Attributes

Definition Classes
RegexParsers -> Parsers
Inherited from:
RegexParsers
def failure(msg: String): Parser[Nothing]

A parser that always fails.

A parser that always fails.

Value parameters

msg

The error message describing the failure.

Attributes

Returns

A parser that always fails with the specified error message.

Inherited from:
Parsers
def floatingPointNumber: Parser[String]

A number following the rules of decimalNumber, with the following optional additions:

A number following the rules of decimalNumber, with the following optional additions:

  • Preceded by a negative sign
  • Followed by e or E and an optionally signed integer
  • Followed by f, f, d or D (after the above rule, if both are used)

Attributes

Inherited from:
JavaTokenParsers
def guard[T](p: => Parser[T]): Parser[T]

A parser generator for guard expressions. The resulting parser will fail or succeed just like the one given as parameter but it will not consume any input.

A parser generator for guard expressions. The resulting parser will fail or succeed just like the one given as parameter but it will not consume any input.

Value parameters

p

a Parser that is to be applied to the input

Attributes

Returns

A parser that returns success if and only if p succeeds but never consumes any input

Inherited from:
Parsers
protected def handleWhiteSpace(source: CharSequence, offset: Int): Int

Method called to handle whitespace before parsers.

Method called to handle whitespace before parsers.

It checks skipWhitespace and, if true, skips anything matching whiteSpace starting from the current offset.

Value parameters

offset

The offset into source from which to match.

source

The input being parsed.

Attributes

Returns

The offset to be used for the next parser.

Inherited from:
RegexParsers
def ident: Parser[String]

Anything that is a valid Java identifier, according to The Java Language Spec. Generally, this means a letter, followed by zero or more letters or numbers.

Anything that is a valid Java identifier, according to The Java Language Spec. Generally, this means a letter, followed by zero or more letters or numbers.

Attributes

Inherited from:
JavaTokenParsers
def log[T](p: => Parser[T])(name: String): Parser[T]

A helper method that turns a Parser into one that will print debugging information to stdout before and after being applied.

A helper method that turns a Parser into one that will print debugging information to stdout before and after being applied.

Attributes

Inherited from:
Parsers
def mkList[T]: (T ~ List[T]) => List[T]

Given a concatenation with a repetition (list), move the concatenated element into the list

Given a concatenation with a repetition (list), move the concatenated element into the list

Attributes

Inherited from:
Parsers
def not[T](p: => Parser[T]): Parser[Unit]

Wrap a parser so that its failures and errors become success and vice versa -- it never consumes any input.

Wrap a parser so that its failures and errors become success and vice versa -- it never consumes any input.

Attributes

Inherited from:
Parsers
def opt[T](p: => Parser[T]): Parser[Option[T]]

A parser generator for optional sub-phrases.

A parser generator for optional sub-phrases.

opt(p) is a parser that returns Some(x) if p returns x and None if p fails.

Value parameters

p

A Parser that is tried on the input

Attributes

Returns

a Parser that always succeeds: either with the result provided by p or with the empty result

Inherited from:
Parsers
def parse[T](p: Parser[T], in: Reader): ParseResult[T]

Parse some prefix of reader in with parser p.

Parse some prefix of reader in with parser p.

Attributes

Inherited from:
RegexParsers
def parse[T](p: Parser[T], in: CharSequence): ParseResult[T]

Parse some prefix of character sequence in with parser p.

Parse some prefix of character sequence in with parser p.

Attributes

Inherited from:
RegexParsers
def parse[T](p: Parser[T], in: Reader[Char]): ParseResult[T]

Parse some prefix of reader in with parser p.

Parse some prefix of reader in with parser p.

Attributes

Inherited from:
RegexParsers
def parseAll[T](p: Parser[T], in: CharSequence): ParseResult[T]

Parse all of character sequence in with parser p.

Parse all of character sequence in with parser p.

Attributes

Inherited from:
RegexParsers
def parseAll[T](p: Parser[T], in: Reader): ParseResult[T]

Parse all of reader in with parser p.

Parse all of reader in with parser p.

Attributes

Inherited from:
RegexParsers
def parseAll[T](p: Parser[T], in: Reader[Char]): ParseResult[T]

Parse all of reader in with parser p.

Parse all of reader in with parser p.

Attributes

Inherited from:
RegexParsers
override def phrase[T](p: Parser[T]): Parser[T]

A parser generator delimiting whole phrases (i.e. programs).

A parser generator delimiting whole phrases (i.e. programs).

phrase(p) succeeds if p succeeds and no input is left over after p.

Value parameters

p

the parser that must consume all input for the resulting parser to succeed.

Attributes

Returns

a parser that has the same result as p, but that only succeeds if p consumed all the input.

Definition Classes
RegexParsers -> Parsers
Inherited from:
RegexParsers
override def positioned[T <: Positional](p: => Parser[T]): Parser[T]

positioned decorates a parser's result with the start position of the input it consumed. If whitespace is being skipped, then it is skipped before the start position is recorded.

positioned decorates a parser's result with the start position of the input it consumed. If whitespace is being skipped, then it is skipped before the start position is recorded.

Value parameters

p

a Parser whose result conforms to Positional.

Attributes

Returns

A parser that has the same behaviour as p, but which marks its result with the start position of the input it consumed after whitespace has been skipped, if it didn't already have a position.

Definition Classes
RegexParsers -> Parsers
Inherited from:
RegexParsers
def rep[T](p: => Parser[T]): Parser[List[T]]

A parser generator for repetitions.

A parser generator for repetitions.

rep(p) repeatedly uses p to parse the input until p fails (the result is a List of the consecutive results of p).

Value parameters

p

a Parser that is to be applied successively to the input

Attributes

Returns

A parser that returns a list of results produced by repeatedly applying p to the input.

Inherited from:
Parsers
def rep1[T](first: => Parser[T], p0: => Parser[T]): Parser[List[T]]

A parser generator for non-empty repetitions.

A parser generator for non-empty repetitions.

rep1(f, p) first uses f (which must succeed) and then repeatedly uses p to parse the input until p fails (the result is a List of the consecutive results of f and p)

Value parameters

first

a Parser that parses the first piece of input

p0

a Parser that is to be applied successively to the rest of the input (if any) -- evaluated at most once, and only when necessary

Attributes

Returns

A parser that returns a list of results produced by first applying f and then repeatedly p to the input (it only succeeds if f matches).

Inherited from:
Parsers
def rep1[T](p: => Parser[T]): Parser[List[T]]

A parser generator for non-empty repetitions.

A parser generator for non-empty repetitions.

rep1(p) repeatedly uses p to parse the input until p fails -- p must succeed at least once (the result is a List of the consecutive results of p)

Value parameters

p

a Parser that is to be applied successively to the input

Attributes

Returns

A parser that returns a list of results produced by repeatedly applying p to the input (and that only succeeds if p matches at least once).

Inherited from:
Parsers
def rep1sep[T](p: => Parser[T], q: => Parser[Any]): Parser[List[T]]

A parser generator for non-empty repetitions.

A parser generator for non-empty repetitions.

rep1sep(p, q) repeatedly applies p interleaved with q to parse the input, until p fails. The parser p must succeed at least once.

Value parameters

p

a Parser that is to be applied successively to the input

q

a Parser that parses the elements that separate the elements parsed by p (interleaved with q)

Attributes

Returns

A parser that returns a list of results produced by repeatedly applying p to the input (and that only succeeds if p matches at least once). The results of p are collected in a list. The results of q are discarded.

Inherited from:
Parsers
def repN[T](num: Int, p: => Parser[T]): Parser[List[T]]

A parser generator for a specified number of repetitions.

A parser generator for a specified number of repetitions.

repN(n, p) uses p exactly n time to parse the input (the result is a List of the n consecutive results of p).

Value parameters

num

the exact number of times p must succeed

p

a Parser that is to be applied successively to the input

Attributes

Returns

A parser that returns a list of results produced by repeatedly applying p to the input (and that only succeeds if p matches exactly n times).

Inherited from:
Parsers
def repNM[T](n: Int, m: Int, p: Parser[T], sep: Parser[Any]): Parser[List[T]]

A parser generator for a specified range of repetitions interleaved by a separator.

A parser generator for a specified range of repetitions interleaved by a separator.

repNM(n, m, p, s) uses p at least n times and up to m times, interleaved with separator s, to parse the input (the result is a List of at least n consecutive results of p and up to m results).

Value parameters

m

maximum number of repetitions

n

minimum number of repetitions

p

a Parser that is to be applied successively to the input

sep

a Parser that interleaves with p

Attributes

Returns

A parser that returns a list of results produced by repeatedly applying p interleaved with sep to the input. The list has a size between n and up to m (and that only succeeds if p matches at least n times).

Inherited from:
Parsers
def repsep[T](p: => Parser[T], q: => Parser[Any]): Parser[List[T]]

A parser generator for interleaved repetitions.

A parser generator for interleaved repetitions.

repsep(p, q) repeatedly uses p interleaved with q to parse the input, until p fails. (The result is a List of the results of p.)

Example: repsep(term, ",") parses a comma-separated list of term's, yielding a list of these terms.

Value parameters

p

a Parser that is to be applied successively to the input

q

a Parser that parses the elements that separate the elements parsed by p

Attributes

Returns

A parser that returns a list of results produced by repeatedly applying p (interleaved with q) to the input. The results of p are collected in a list. The results of q are discarded.

Inherited from:
Parsers
def skipWhitespace: Boolean

Attributes

Inherited from:
RegexParsers
def stringLiteral: Parser[String]

Double quotes (") enclosing a sequence of:

Double quotes (") enclosing a sequence of:

  • Any character except double quotes, control characters or backslash (\)
  • A backslash followed by another backslash, a single or double quote, or one of the letters b, f, n, r or t
  • \ followed by u followed by four hexadecimal digits

Attributes

Inherited from:
JavaTokenParsers
def success[T](v: T): Parser[T]

A parser that always succeeds.

A parser that always succeeds.

Value parameters

v

The result for the parser

Attributes

Returns

A parser that always succeeds, with the given result v

Inherited from:
Parsers
def wholeNumber: Parser[String]

An integer, without sign or with a negative sign.

An integer, without sign or with a negative sign.

Attributes

Inherited from:
JavaTokenParsers

Concrete fields

val ReservedWords: Set[String]

Words that can never be used as a variable name.

Words that can never be used as a variable name.

Includes every function and functional keyword of the grammar, the built-in constants (pi, e, i, inf), and the REPL command words, so a session binding can never shadow or be shadowed by a command. Bare sin or simplify is a parse error, not a variable; names merely starting with a reserved word (sina, evalx) stay legal.

Attributes

lazy val andExpr: Parser[_Expression]

Conjunction level: left-folding and.

Conjunction level: left-folding and.

Attributes

lazy val basedLiteral: Parser[_Value]

A based integer literal: 0b1011, 0o17, 0xff, and 0t1T0 for balanced ternary.

A based integer literal: 0b1011, 0o17, 0xff, and 0t1T0 for balanced ternary.

Listed before number in value, and it has to be: the ordinary numeric regex happily matches the leading 0 of 0xff and leaves xff behind to fail as a stray variable, so a later alternative never gets the chance.

The digits are word-boundary guarded so 0b1011x is a parse error rather than a literal followed by a variable.

Attributes

lazy val constant: Parser[_Value]

The built-in constants pi, e, i, inf, true, false, and unknown, all word-boundary guarded.

The built-in constants pi, e, i, inf, true, false, and unknown, all word-boundary guarded.

i is the imaginary unit (_Complex(0, 1)); 3i is implicit multiplication yielding _Complex(0, 3), while im or i1 stay ordinary variables. true/false are the boolean literals (_Bool) and unknown is the third Kleene truth value (_Truth.Unknown); the guard keeps truex an ordinary variable.

Attributes

lazy val equationExpr: Parser[_Expression]

Top-level grammar: an optional equation or equality relation.

Top-level grammar: an optional equation or equality relation.

Operators are tried longest-first (>= before >, == before =) so a two-character operator is never shadowed by its prefix. Non-associative: only one optional relation per expression, so a = b = c and 0 < x < 1 are both parse errors. Chained comparisons are a separate feature. (a = b) is valid as a sub-expression so a named equation can be bound: h := x = 5, then solve(h, x).

Attributes

lazy val expr: Parser[_Expression]

An expression with an optional leading sign.

An expression with an optional leading sign.

Attributes

lazy val factor: Parser[_Expression]

A grammar factor: function, functional, matrix literal, value, or parenthesised expression.

A grammar factor: function, functional, matrix literal, value, or parenthesised expression.

Attributes

lazy val function: Parser[_Expression]

All mathematical function keywords and their AST mappings.

All mathematical function keywords and their AST mappings.

Attributes

lazy val functional: Parser[_Expression]

All functional keywords (operators over bound variables) and their AST mappings.

All functional keywords (operators over bound variables) and their AST mappings.

Attributes

lazy val implExpr: Parser[_Expression]

Implication level: right-associative and the loosest connective.

Implication level: right-associative and the loosest connective.

Attributes

lazy val logicExpr: Parser[_Expression]

A full logic expression -- the boolean connectives bind loosest, below =/==.

A full logic expression -- the boolean connectives bind loosest, below =/==.

Precedence (tightest to loosest): not > and > xor > or > implies; implies is right-associative, the others left-fold. So a or b and c is a or (b and c) and x = 1 and y = 2 is (x = 1) and (y = 2).

Attributes

lazy val matrixLiteral: Parser[_Expression]

A matrix literal: [[a, b], [c, d]]. All rows must have the same length.

A matrix literal: [[a, b], [c, d]]. All rows must have the same length.

Attributes

lazy val matrixRow: Parser[List[_Expression]]

A single row of a matrix literal.

A single row of a matrix literal.

Attributes

lazy val notExpr: Parser[_Expression]

Negation level and the descent into the arithmetic grammar.

Negation level and the descent into the arithmetic grammar.

equationExpr is tried before the parenthesised-logic branch so ordinary arithmetic parentheses ((x + 1) * 2) keep parsing through factor; only when the arithmetic parse fails ((a and b)) is the group re-read as logic. guardedExpr stays bound to equationExpr, so 2 * (x = 1) remains a parse error and equations stay top-level only.

Attributes

lazy val number: Parser[_Value]

An unsigned floating-point literal.

An unsigned floating-point literal.

Unsigned by design — a - is always a grammar operator, never part of the token. Scientific notation exponent signs (3E-5) are handled by the regex and are unaffected.

Attributes

lazy val orExpr: Parser[_Expression]

Disjunction level: left-folding or.

Disjunction level: left-folding or.

Attributes

lazy val power: Parser[_Expression]

Right-associative exponentiation: 2 ^ 3 ^ 2 parses as 2 ^ (3 ^ 2).

Right-associative exponentiation: 2 ^ 3 ^ 2 parses as 2 ^ (3 ^ 2).

Attributes

lazy val signedPower: Parser[_Expression]

A signed operand for positions after an explicit operator (3 * -x, 2^-x).

A signed operand for positions after an explicit operator (3 * -x, 2^-x).

Attributes

lazy val signedValue: Parser[_Expression]

A signed value for integral-limit positions (integral(x, x, -1, 1)).

A signed value for integral-limit positions (integral(x, x, -1, 1)).

Attributes

lazy val simpleExpr: Parser[_Expression]

A sequence of additive terms.

A sequence of additive terms.

Attributes

lazy val term: Parser[_Expression]

Explicit * and / take a signed right operand; implicit multiplication takes an unsigned one.

Explicit * and / take a signed right operand; implicit multiplication takes an unsigned one.

This keeps 3-2 binding as subtraction rather than 3 * (-2).

Attributes

lazy val topLevel: Parser[_Expression]

The top-level production: a full logic expression (connectives bind loosest; a plain arithmetic or equation expression passes through unchanged).

The top-level production: a full logic expression (connectives bind loosest; a plain arithmetic or equation expression passes through unchanged).

Attributes

lazy val value: Parser[_Expression]

A bare value: number, constant, or variable.

A bare value: number, constant, or variable.

Attributes

lazy val variable: Parser[_Variable]

A user-defined variable name.

A user-defined variable name.

Matches [a-zA-Z][a-zA-Z0-9_]* and rejects any string in ReservedWords. The regex is greedy so simplify cannot fall back to variable simplif times y.

Attributes

lazy val xorExpr: Parser[_Expression]

Exclusive-disjunction level: left-folding xor.

Exclusive-disjunction level: left-folding xor.

Attributes

Inherited fields

protected val whiteSpace: Regex

Attributes

Inherited from:
RegexParsers

Implicits

Inherited implicits

implicit def accept(e: Elem): Parser[Elem]

A parser that matches only the given element e.

A parser that matches only the given element e.

The method is implicit so that elements can automatically be lifted to their parsers. For example, when parsing Tokens, Identifier("new") (which is a Token) can be used directly, instead of first creating a Parser using accept(Identifier("new")).

Value parameters

e

the Elem that must be the next piece of input for the returned parser to succeed

Attributes

Returns

a tParser that succeeds if e is the next available input.

Inherited from:
Parsers
implicit def literal(s: String): Parser[String]

A parser that matches a literal string

A parser that matches a literal string

Attributes

Inherited from:
RegexParsers
implicit def regex(r: Regex): Parser[String]

A parser that matches a regex string

A parser that matches a regex string

Attributes

Inherited from:
RegexParsers
Generated with