Packages

trait TermsParsers extends RegexParsers with RegexCompletionSupport with TermsParsingHelpers with AlphabeticalSortingSupport

This trait adds specialized parsers for dealing with large lists of terms, both in terms of parsing (using a fast trie-based lookup) and completion (supporting fuzzy matching)

Linear Supertypes
AlphabeticalSortingSupport, TermsParsingHelpers, RegexCompletionSupport, CompletionSupport, CompletionTypes, RegexParsers, Parsers, AnyRef, Any
Known Subclasses
TermsParsers
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TermsParsers
  2. AlphabeticalSortingSupport
  3. TermsParsingHelpers
  4. RegexCompletionSupport
  5. CompletionSupport
  6. CompletionTypes
  7. RegexParsers
  8. Parsers
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. abstract class Parser[+T] extends CompletionSupport.Parser[T]

    The root class of completion parsers, overloading the Parser class.

    The root class of completion parsers, overloading the Parser class. Completion parsers are functions from the Input type to ParseResult, with the addition of a completions function from the Input type to an instance of Completions

    Definition Classes
    CompletionSupport
  2. case class Completion(value: Elems, score: Int = DefaultCompletionScore, meta: Option[String] = None) extends Product with Serializable

    Completion entry

    Completion entry

    value

    entry value (e.g. string literal)

    score

    entry score (defines the order of entries within a set, the higher the better)

    meta

    entry meta (e.g. visual style)

    Definition Classes
    CompletionTypes
  3. case class CompletionSet(tag: CompletionTag, completions: HashMap[Elems, Completion]) extends Product with Serializable

    Set of related completion entries

    Set of related completion entries

    tag

    set tag

    completions

    set of unique completion entries

    Definition Classes
    CompletionTypes
  4. case class CompletionTag(label: String, score: Int, description: Option[String], meta: Option[String]) extends Product with Serializable

    Tag defining identification and attributes of a set of completion entries

    Tag defining identification and attributes of a set of completion entries

    label

    tag label

    score

    tag score (the higher the better, 0 by default)

    description

    tag description (optional) - can be used for additional information e.g. for a tooltip

    meta

    tag meta (optional) - can be used e.g. to define visual style

    Definition Classes
    CompletionTypes
  5. case class Completions(position: Position, meta: Option[String], sets: HashMap[String, CompletionSet]) extends Product with Serializable

    Result of parser completion, listing the possible entry alternatives at a certain input position

    Result of parser completion, listing the possible entry alternatives at a certain input position

    position

    position in the input where completion entries apply

    sets

    completion entries, grouped per tag

    Definition Classes
    CompletionTypes
  6. type Elem = Char
    Definition Classes
    RegexParsers → Parsers
  7. type Elems = Seq[Elem]
    Definition Classes
    CompletionTypes
  8. case class Error extends NoSuccess with Product with Serializable
    Definition Classes
    Parsers
  9. case class Failure extends NoSuccess with Product with Serializable
    Definition Classes
    Parsers
  10. type Input = Reader[Elem]
    Definition Classes
    Parsers
  11. sealed abstract class NoSuccess extends ParseResult[Nothing]
    Definition Classes
    Parsers
  12. trait OnceParser[+T] extends scala.util.parsing.combinator.Parsers.Parser[T]
    Definition Classes
    Parsers
  13. sealed abstract class ParseResult[+T] extends AnyRef
    Definition Classes
    Parsers
  14. case class Success[+T] extends ParseResult[T] with Product with Serializable
    Definition Classes
    Parsers
  15. case class ~[+a, +b] extends Product with Serializable
    Definition Classes
    Parsers
  16. case class MatchingTerm(term: String, column: Int) extends Product with Serializable
    Definition Classes
    TermsParsingHelpers
  17. case class MatchingTerms(terms: Seq[(TermsParsingHelpers.this)#MatchingTerm], finalColumn: Int) extends Product with Serializable
    Definition Classes
    TermsParsingHelpers

Value Members

  1. object Completion extends Product with Serializable
    Definition Classes
    CompletionTypes
  2. object CompletionSet extends Product with Serializable
    Definition Classes
    CompletionTypes
  3. object CompletionTag extends Product with Serializable
    Definition Classes
    CompletionTypes
  4. object Completions extends Product with Serializable
    Definition Classes
    CompletionTypes
  5. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. final def ##(): Int
    Definition Classes
    AnyRef → Any
  7. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. val DefaultCompletionScore: Int
    Definition Classes
    CompletionTypes
  9. val DefaultCompletionTag: String
    Definition Classes
    CompletionTypes
  10. def OnceParser[T](f: (Input) ⇒ ParseResult[T]): TermsParsers.Parser[T] with OnceParser[T]
    Definition Classes
    Parsers
  11. def Parser[T](f: (Input) ⇒ ParseResult[T], c: (Input) ⇒ Completions): Parser[T]
    Definition Classes
    CompletionSupport
  12. def Parser[T](f: (Input) ⇒ ParseResult[T]): TermsParsers.Parser[T]
    Definition Classes
    Parsers
  13. def accept[U](expected: String, f: PartialFunction[Elem, U], completions: Set[Elem] = Set()): 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)

    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

    completions

    Possible alternatives (for completion)

    returns

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

    Definition Classes
    CompletionSupport
  14. def accept[ES](es: ES)(implicit arg0: (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.

    es

    the list of expected elements

    returns

    a Parser that recognizes a specified list of elements

    Definition Classes
    CompletionSupport → Parsers
  15. 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")).

    e

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

    returns

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

    Definition Classes
    CompletionSupport → Parsers
  16. def accept[U](expected: String, f: PartialFunction[Elem, U]): TermsParsers.Parser[U]
    Definition Classes
    Parsers
  17. def acceptIf(p: (Elem) ⇒ Boolean, completions: Set[Elem])(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.

    p

    A predicate that determines which elements match.

    completions

    Possible completions

    err

    A function from the received element into an error message.

    returns

    A parser for elements satisfying p(e).

    Definition Classes
    CompletionSupport
  18. def acceptIf(p: (Elem) ⇒ Boolean)(err: (Elem) ⇒ String): TermsParsers.Parser[Elem]
    Definition Classes
    Parsers
  19. def acceptMatch[U](expected: String, f: PartialFunction[Elem, U], completions: Set[Completion]): Parser[U]
    Definition Classes
    CompletionSupport
  20. def acceptMatch[U](expected: String, f: PartialFunction[Elem, U]): TermsParsers.Parser[U]
    Definition Classes
    Parsers
  21. def acceptSeq[ES](es: ES)(implicit arg0: (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.

    es

    the list of expected elements

    returns

    a Parser that recognizes a specified list of elements

    Definition Classes
    CompletionSupport → Parsers
  22. def alphabeticallySortedCompletions(terms: Iterable[String], maxCompletionsCount: Int): CompletionSet
    Definition Classes
    AlphabeticalSortingSupport
  23. val areLiteralsCaseSensitive: Boolean
    Attributes
    protected
    Definition Classes
    RegexCompletionSupport
  24. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  25. 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.

    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

    Definition Classes
    CompletionSupport
  26. 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.

    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

    Definition Classes
    CompletionSupport
  27. def chainl1[T, U](first: ⇒ TermsParsers.Parser[T], p: ⇒ TermsParsers.Parser[U], q: ⇒ TermsParsers.Parser[(T, U) ⇒ T]): TermsParsers.Parser[T]
    Definition Classes
    Parsers
  28. def chainl1[T](p: ⇒ TermsParsers.Parser[T], q: ⇒ TermsParsers.Parser[(T, T) ⇒ T]): TermsParsers.Parser[T]
    Definition Classes
    Parsers
  29. 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.

    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)

    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

    combine

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

    first

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

    Definition Classes
    CompletionSupport
  30. def chainr1[T, U](p: ⇒ TermsParsers.Parser[T], q: ⇒ TermsParsers.Parser[(T, U) ⇒ U], combine: (T, U) ⇒ U, first: U): TermsParsers.Parser[U]
    Definition Classes
    Parsers
  31. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  32. 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).

    Definition Classes
    CompletionSupport
  33. def commit[T](p: ⇒ TermsParsers.Parser[T]): TermsParsers.Parser[T]
    Definition Classes
    Parsers
  34. def complete[T](p: Parser[T], in: CharSequence): Completions

    Returns completions for character sequence in with parser p.

    Returns completions for character sequence in with parser p.

    Definition Classes
    RegexCompletionSupport
  35. def complete[T](p: Parser[T], in: Reader[Char]): Completions

    Returns completions for read in with parser p.

    Returns completions for read in with parser p.

    Definition Classes
    RegexCompletionSupport
  36. def completeString[T](p: Parser[T], input: String): Seq[String]

    Returns flattened string completions for character sequence in with parser p.

    Returns flattened string completions for character sequence in with parser p.

    Definition Classes
    RegexCompletionSupport
  37. def dropAnyWhiteSpace(input: Input): Input
    Attributes
    protected
    Definition Classes
    RegexCompletionSupport
  38. 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.

    e

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

    returns

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

    Definition Classes
    CompletionSupport → Parsers
  39. def elem(kind: String, p: (Elem) ⇒ Boolean, completions: Set[Elem] = Set()): 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.

    kind

    The element kind, used for error messages

    p

    A predicate that determines which elements match.

    completions

    Possible alternatives (for completion)

    Definition Classes
    CompletionSupport
  40. def elem(kind: String, p: (Elem) ⇒ Boolean): TermsParsers.Parser[Elem]
    Definition Classes
    Parsers
  41. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  42. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  43. def err(msg: String): Parser[Nothing]

    A parser that results in an error.

    A parser that results in an error.

    msg

    The error message describing the failure.

    returns

    A parser that always fails with the specified error message.

    Definition Classes
    CompletionSupport → Parsers
  44. def failure(msg: String): Parser[Nothing]

    A parser that always fails.

    A parser that always fails.

    msg

    The error message describing the failure.

    returns

    A parser that always fails with the specified error message.

    Definition Classes
    CompletionSupport → Parsers
  45. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  46. def findAllMatchingTerms(in: Input, offset: Int, map: Trie): MatchingTerms
    Attributes
    protected
    Definition Classes
    TermsParsingHelpers
  47. def findAllTermsWithPrefix(in: Input, offset: Int, map: Trie): Stream[String]
    Attributes
    protected
    Definition Classes
    TermsParsingHelpers
  48. def findMatchOffsets(s: String, in: Input): (Int, Int)
    Attributes
    protected
    Definition Classes
    RegexCompletionSupport
  49. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  50. def guard[T](p: ⇒ Parser[T]): Parser[T]

    A parser generator for guard expressions.

    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.

    p

    a Parser that is to be applied to the input

    returns

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

    Definition Classes
    CompletionSupport
  51. def guard[T](p: ⇒ TermsParsers.Parser[T]): TermsParsers.Parser[T]
    Definition Classes
    Parsers
  52. def handleWhiteSpace(input: Input): Int
    Attributes
    protected
    Definition Classes
    RegexCompletionSupport
  53. def handleWhiteSpace(source: CharSequence, offset: Int): Int
    Attributes
    protected
    Definition Classes
    RegexParsers
  54. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  55. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  56. implicit def literal(s: String): Parser[String]
    Definition Classes
    RegexCompletionSupport → RegexParsers
  57. 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.

    Definition Classes
    CompletionSupport
  58. def log[T](p: ⇒ TermsParsers.Parser[T])(name: String): TermsParsers.Parser[T]
    Definition Classes
    Parsers
  59. def mkList[T]: (~[T, List[T]]) ⇒ List[T]
    Definition Classes
    Parsers
  60. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  61. 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.

    Definition Classes
    CompletionSupport
  62. def not[T](p: ⇒ TermsParsers.Parser[T]): TermsParsers.Parser[Unit]
    Definition Classes
    Parsers
  63. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  64. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  65. def oneOfTerms(terms: Seq[String], maxCompletionsCount: Int): Parser[String]

    This defines a parser which parses any of the specified terms.

    This defines a parser which parses any of the specified terms. The parser performs a fast match by means of a trie data structure, initialized upon creation. Completions will return all available terms below the matching trie node, in alphabetical order (if any)

    terms

    the list of terms to build the parser for

    maxCompletionsCount

    maximum number of completions returned by the parser

    returns

    parser instance

  66. def oneOfTermsFuzzy(terms: Seq[String], maxCompletionsCount: Int, similarityMeasure: (String, String) ⇒ Double = diceSorensenSimilarity, similarityThreshold: Int = DefaultSimilarityThreshold): Parser[String]

    This defines a parser which parses any of the specified terms, and is capable of fuzzing completion on the input.

    This defines a parser which parses any of the specified terms, and is capable of fuzzing completion on the input.

    Parsing itself requires an exact match and is using the same trie-based technique as oneOfTerms.

    For fuzzy completion, terms are decomposed in their trigrams and stored in a map indexed by the corresponding trigrams. This allows fast lookup of a set of completion candidates which share the same trigrams as the input. These candidates are ranked by the number of shared trigrams with the input, and a subset of the highest ranked candidates are kept. These candidates are then re-evaluated with a more precise (but slower) specified similarity metric (Dice-Sorensen by default, see com.nexthink.utils.parsing.distance.DiceSorensenDistance). The top candidates according to a specified maximum number are returned as completions.

    Note that terms are affixed so that the starting and ending two characters count more than the others in order to favor completions which start or end with the same characters as the input.

    This approach is described in "Taming Text", chapter 4 "Fuzzy string matching", https://www.manning.com/books/taming-text

    terms

    the list of terms to build the parser for

    maxCompletionsCount

    maximum number of completions returned by the parser

    similarityMeasure

    the string similarity metric to be used. Any (String, String) => Double function can be passed in. Various implementations are provided: com.nexthink.utils.parsing.distance.DiceSorensenDistance (default), com.nexthink.utils.parsing.distance.JaroWinklerDistance, com.nexthink.utils.parsing.distance.LevenshteinDistance & com.nexthink.utils.parsing.distance.NgramDistance. Metric choice depends on factors such as type of terms, performance, etc.

    similarityThreshold

    the minimum similarity score for an entry to be considered as a completion candidate

    returns

    parser instance

  67. 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.

    p

    A Parser that is tried on the input

    returns

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

    Definition Classes
    CompletionSupport
  68. def opt[T](p: ⇒ TermsParsers.Parser[T]): TermsParsers.Parser[Option[T]]
    Definition Classes
    Parsers
  69. def parse[T](p: TermsParsers.Parser[T], in: Reader): ParseResult[T]
    Definition Classes
    RegexParsers
  70. def parse[T](p: TermsParsers.Parser[T], in: CharSequence): ParseResult[T]
    Definition Classes
    RegexParsers
  71. def parse[T](p: TermsParsers.Parser[T], in: Reader[Char]): ParseResult[T]
    Definition Classes
    RegexParsers
  72. def parseAll[T](p: TermsParsers.Parser[T], in: CharSequence): ParseResult[T]
    Definition Classes
    RegexParsers
  73. def parseAll[T](p: TermsParsers.Parser[T], in: Reader): ParseResult[T]
    Definition Classes
    RegexParsers
  74. def parseAll[T](p: TermsParsers.Parser[T], in: Reader[Char]): ParseResult[T]
    Definition Classes
    RegexParsers
  75. def phrase[T](p: Parser[T]): Parser[T]

    A parser generator delimiting whole phrases (i.e.

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

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

    p

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

    returns

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

    Definition Classes
    CompletionSupport
  76. def phrase[T](p: TermsParsers.Parser[T]): TermsParsers.Parser[T]
    Definition Classes
    RegexParsers → Parsers
  77. def positioned[T <: Positional](p: ⇒ Parser[T]): Parser[T]

    positioned decorates a parser's result with the start position of the input it consumed.

    positioned decorates a parser's result with the start position of the input it consumed.

    p

    a Parser whose result conforms to Positional.

    returns

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

    Definition Classes
    RegexCompletionSupport → CompletionSupport
  78. def positioned[T <: Positional](p: ⇒ TermsParsers.Parser[T]): TermsParsers.Parser[T]
    Definition Classes
    RegexParsers → Parsers
  79. implicit def regex(r: Regex): Parser[String]
    Definition Classes
    RegexCompletionSupport → RegexParsers
  80. def remainder[T](reader: Reader[T]): String
    Definition Classes
    TermsParsingHelpers
  81. 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).

    p

    a Parser that is to be applied successively to the input

    returns

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

    Definition Classes
    CompletionSupport
  82. def rep[T](p: ⇒ TermsParsers.Parser[T]): TermsParsers.Parser[List[T]]
    Definition Classes
    Parsers
  83. 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)

    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

    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).

    Definition Classes
    CompletionSupport
  84. 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)

    p

    a Parser that is to be applied successively to the input

    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).

    Definition Classes
    CompletionSupport
  85. def rep1[T](first: ⇒ TermsParsers.Parser[T], p0: ⇒ TermsParsers.Parser[T]): TermsParsers.Parser[List[T]]
    Definition Classes
    Parsers
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The p0 call-by-name arguments is evaluated at most once per constructed Parser object, instead of on every need that arises during parsing.

  86. def rep1[T](p: ⇒ TermsParsers.Parser[T]): TermsParsers.Parser[List[T]]
    Definition Classes
    Parsers
  87. 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.

    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)

    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.

    Definition Classes
    CompletionSupport
  88. def rep1sep[T](p: ⇒ TermsParsers.Parser[T], q: ⇒ TermsParsers.Parser[Any]): TermsParsers.Parser[List[T]]
    Definition Classes
    Parsers
  89. def repN[T](num: Int, p0: ⇒ 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).

    num

    the exact number of times p must succeed

    p0

    a Parser that is to be applied successively to the input

    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).

    Definition Classes
    CompletionSupport
  90. def repN[T](num: Int, p: ⇒ TermsParsers.Parser[T]): TermsParsers.Parser[List[T]]
    Definition Classes
    Parsers
  91. 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.

    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

    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.

    Definition Classes
    CompletionSupport
  92. def repsep[T](p: ⇒ TermsParsers.Parser[T], q: ⇒ TermsParsers.Parser[Any]): TermsParsers.Parser[List[T]]
    Definition Classes
    Parsers
  93. def skipWhitespace: Boolean
    Definition Classes
    RegexParsers
  94. def subSequence[T](reader: Reader[T], end: Int): String
    Definition Classes
    TermsParsingHelpers
  95. def success[T](v: T): Parser[T]

    A parser that always succeeds.

    A parser that always succeeds.

    v

    The result for the parser

    returns

    A parser that always succeeds, with the given result v

    Definition Classes
    CompletionSupport → Parsers
  96. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  97. def toString(): String
    Definition Classes
    AnyRef → Any
  98. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  99. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  100. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  101. val whiteSpace: Regex
    Attributes
    protected
    Definition Classes
    RegexParsers
  102. object NoSuccess
    Definition Classes
    Parsers

Inherited from AlphabeticalSortingSupport

Inherited from TermsParsingHelpers

Inherited from RegexCompletionSupport

Inherited from CompletionSupport

Inherited from CompletionTypes

Inherited from RegexParsers

Inherited from Parsers

Inherited from AnyRef

Inherited from Any

Ungrouped