Packages

abstract class Parser extends ParserCommon

Self Type
Parser
Source
Parsers.scala
Linear Supertypes
Parsers.ParserCommon, AnyRef, Any
Known Subclasses
QuasiquoteParser, OutlineParser, SourceFileParser, UnitParser, ScaladocUnitParser
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Parser
  2. ParserCommon
  3. AnyRef
  4. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new Parser()

Type Members

  1. class ParserTreeBuilder extends TreeBuilder
  2. sealed trait PatternContextSensitive extends AnyRef

    Methods which implicitly propagate the context in which they were called: either in a pattern context or not.

    Methods which implicitly propagate the context in which they were called: either in a pattern context or not. Formerly, this was threaded through numerous methods as boolean isPattern.

  3. final class SeqContextSensitive extends PatternContextSensitive

    Methods which implicitly propagate whether the initial call took place in a context where sequences are allowed.

    Methods which implicitly propagate whether the initial call took place in a context where sequences are allowed. Formerly, this was threaded through methods as boolean seqOK.

Abstract Value Members

  1. abstract def deprecationWarning(off: Parsers.Offset, msg: String, since: String): Unit
    Definition Classes
    ParserCommon
  2. abstract val in: Parsers.Scanner
    Definition Classes
    Parser → ParserCommon
  3. abstract def incompleteInputError(msg: String): Unit
  4. abstract def parseStartRule: () => Global.Tree
  5. abstract def source: SourceFile
  6. abstract def syntaxError(offset: Parsers.Offset, msg: String): Unit
  7. abstract def unit: Global.CompilationUnit
  8. abstract def warning(offset: Parsers.Offset, msg: String, category: WarningCategory): Unit
  9. abstract def xmlLiteral(): Global.Tree
  10. abstract def xmlLiteralPattern(): Global.Tree

Concrete Value Members

  1. def accept(token: Parsers.Token): Parsers.Offset

    Consume one token of the specified type, or signal an error if it is not there.

    Consume one token of the specified type, or signal an error if it is not there.

    Definition Classes
    Parser → ParserCommon
  2. def acceptStatSep(): Unit

    semi = nl {nl} | `;`
nl  = `\n` // where allowed
  3. def acceptStatSepOpt(): Unit
  4. def accessModifierOpt(): Global.Modifiers

    AccessModifier ::= (private | protected) [AccessQualifier]
  5. def accessQualifierOpt(mods: Global.Modifiers): Global.Modifiers

    AccessQualifier ::= `[` (Id | this) `]`
  6. def annotTypeRest(t: Global.Tree): Global.Tree
  7. def annotationExpr(): Global.Tree
  8. def annotations(skipNewLines: Boolean): List[Global.Tree]

    Annotations       ::= {`@` SimpleType {ArgumentExprs}}
ConstrAnnotations ::= {`@` SimpleType ArgumentExprs}
  9. def argumentExprs(): List[Global.Tree]

    ArgumentExprs ::= `(` [Exprs] `)`
                | [nl] BlockExpr
  10. def argumentPatterns(): List[Global.Tree]
  11. val assumedClosingParens: Map[Int, Int]
  12. def atInPos[T <: Global.Tree](t: T): T
  13. def atPos[T <: Global.Tree](pos: Global.Position)(t: T): T
  14. def atPos[T <: Global.Tree](start: Parsers.Offset, point: Parsers.Offset, end: Parsers.Offset)(t: T): T
  15. def atPos[T <: Global.Tree](start: Parsers.Offset, point: Parsers.Offset)(t: T): T
  16. def atPos[T <: Global.Tree](offset: Parsers.Offset)(t: T): T
  17. def block(): Global.Tree

    Block ::= BlockStatSeq
    Note

    Return tree does not carry position.

  18. def blockExpr(): Global.Tree

    BlockExpr ::= `{` (CaseClauses | Block) `}`
  19. def blockStatSeq(): List[Global.Tree]

    BlockStatSeq ::= { BlockStat semi } [ResultExpr]
BlockStat    ::= Import
               | Annotations [implicit] [lazy] Def
               | Annotations LocalModifiers TmplDef
               | Expr1
               |
  20. def bound(tok: Parsers.Token): Global.Tree
  21. def caseBlock(): Global.Tree
  22. def caseClause(): Global.CaseDef
  23. def caseClauses(): List[Global.CaseDef]

    CaseClauses ::= CaseClause {CaseClause}
CaseClause  ::= case Pattern [Guard] `=>` Block
  24. final def caseSeparated[T](part: => T): List[T]
    Annotations
    @inline()
  25. def checkAssoc(offset: Parsers.Offset, op: Global.Name, leftAssoc: Boolean): Unit
  26. def checkHeadAssoc(leftAssoc: Boolean): Unit
  27. def checkKeywordDefinition(): Unit
  28. def checkNoEscapingPlaceholders[T](op: => T): T
  29. def checkNotByNameOrVarargs(tpt: Global.Tree): Unit

    Check that type parameter is not by name or repeated.

  30. def checkQMarkDefinition(): Unit
  31. def checkQMarkUsage(): Unit
  32. def classDef(start: Parsers.Offset, mods: Global.Modifiers): Global.ClassDef

    ClassDef ::= Id [TypeParamClause] ConstrAnnotations
             [AccessModifier] ClassParamClauses RequiresTypeOpt ClassTemplateOpt
TraitDef ::= Id [TypeParamClause] RequiresTypeOpt TraitTemplateOpt
  33. final def commaSeparated[T](part: => T): List[T]

    , with the separator fixed to commas.

    tokenSeparated

    , with the separator fixed to commas. tokenSeparated }}}

    Definition Classes
    ParserCommon
    Annotations
    @inline()
  34. def compilationUnit(): Global.PackageDef

    CompilationUnit ::= {package QualId semi} TopStatSeq
  35. def condExpr(): Global.Tree
  36. def constrBlock(vparamss: List[List[Global.ValDef]]): Global.Tree

    ConstrBlock    ::=  `{` SelfInvocation {semi BlockStat} `}`
  37. def constrExpr(vparamss: List[List[Global.ValDef]]): Global.Tree

    ConstrExpr      ::=  SelfInvocation
                  |  ConstrBlock
  38. def constructorAnnotations(): List[Global.Tree]
  39. def convertToParam(tree: Global.Tree): Global.ValDef

    Convert tree to formal parameter.

  40. def convertToParams(tree: Global.Tree): List[Global.ValDef]

    Convert tree to formal parameter list.

  41. def convertToTypeId(tree: Global.Tree): Global.Tree

    Convert (qual)ident to type identifier.

  42. def defOrDcl(pos: Parsers.Offset, mods: Global.Modifiers): List[Global.Tree]

    Def    ::= val PatDef
         | var PatDef
         | def FunDef
         | type [nl] TypeDef
         | TmplDef
Dcl    ::= val PatDcl
         | var PatDcl
         | def FunDcl
         | type [nl] TypeDcl
  43. final def dropAnyBraces[T](body: => T): T
    Definition Classes
    ParserCommon
    Annotations
    @inline()
  44. def ensureEarlyDef(tree: Global.Tree): Global.Tree
  45. def enumerator(isFirst: Boolean, allowNestedIf: Boolean = true): List[Global.Tree]
  46. def enumerators(): List[Global.Tree]

    Enumerators ::= Generator {semi Enumerator}
Enumerator  ::=  Generator
              |  Guard
              |  Pattern1 `=` Expr
  47. def errorPatternTree: Global.Ident
  48. def errorTermTree: Global.Literal
  49. def errorTypeTree: Global.TypeTree
  50. def expectedMsg(token: Parsers.Token): String
  51. def expectedMsgTemplate(exp: String, fnd: String): String
  52. def expr(location: Location): Global.Tree
  53. def expr(): Global.Tree

    Expr       ::= (Bindings | [`implicit`] Id | `_`)  `=>` Expr
             | Expr1
ResultExpr ::= (Bindings | Id `:` CompoundType) `=>` Block
             | Expr1
Expr1      ::= if `(` Expr `)` {nl} Expr [[semi] else Expr]
             | try (`{` Block `}` | Expr) [catch `{` CaseClauses `}`] [finally Expr]
             | while `(` Expr `)` {nl} Expr
             | do Expr [semi] while `(` Expr `)`
             | for (`(` Enumerators `)` | `{` Enumerators `}`) {nl} [yield] Expr
             | throw Expr
             | return [Expr]
             | [SimpleExpr `.`] Id `=` Expr
             | SimpleExpr1 ArgumentExprs `=` Expr
             | PostfixExpr Ascription
             | PostfixExpr match `{` CaseClauses `}`
Bindings   ::= `(` [Binding {`,` Binding}] `)`
Binding    ::= (Id | `_`) [`:` Type]
Ascription ::= `:` CompoundType
             | `:` Annotation {Annotation}
             | `:` `_` `*`
  54. def expr0(location: Location): Global.Tree
  55. def exprSimpleType(): Global.Tree
  56. def exprTypeArgs(): List[Global.Tree]
  57. def finishBinaryOp(isExpr: Boolean, opinfo: OpInfo, rhs: Global.Tree): Global.Tree
  58. def finishPostfixOp(start: Int, base: List[OpInfo], opinfo: OpInfo): Global.Tree
  59. def followingIsScala3Vararg(): Boolean

    Is current ident a *, and is it followed by a ) or , )?

  60. implicit def fresh: FreshNameCreator
  61. def funDefOrDcl(start: Int, mods: Global.Modifiers): Global.Tree

    FunDef ::= FunSig [`:` Type] `=` [`macro`] Expr
        |  FunSig [nl] `{` Block `}`
        |  `this` ParamClause ParamClauses
               (`=` ConstrExpr | [nl] ConstrBlock)
FunDcl ::= FunSig [`:` Type]
FunSig ::= id [FunTypeParamClause] ParamClauses
  62. def funDefRest(start: Parsers.Offset, nameOffset: Parsers.Offset, mods: Global.Modifiers, name: Global.Name): Global.Tree
  63. def generator(eqOK: Boolean, allowNestedIf: Boolean = true): List[Global.Tree]

    Generator ::= [`case`] Pattern1 (`<-` | `=`) Expr [Guard]
  64. def guard(): Global.Tree

    Guard ::= if PostfixExpr
  65. def ident(): Global.Name
  66. def ident(skipIt: Boolean): Global.Name

    Assumed (provisionally) to be TermNames.

  67. def identForType(skipIt: Boolean): Global.TypeName
  68. def identForType(): Global.TypeName

    For when it's known already to be a type name.

  69. def identOrMacro(): Global.Name
  70. def implicitClosure(start: Parsers.Offset, location: Location): Global.Tree

    Expr ::= implicit Id `=>` Expr
  71. def importClause(): List[Global.Tree]

    Import  ::= import ImportExpr {`,` ImportExpr}
  72. def importExpr(): Global.Tree

    ImportExpr ::= StableId `.` (Id | `_` | ImportSelectors)
  73. def importSelector(): Global.ImportSelector

    ImportSelector ::= Id [`=>` Id | `=>` `_`]
  74. def importSelectors(): List[Global.ImportSelector]

    ImportSelectors ::= `{` {ImportSelector `,`} (ImportSelector | `_`) `}`
  75. final def inBraces[T](body: => T): T
    Definition Classes
    ParserCommon
    Annotations
    @inline()
  76. final def inBracesOrError[T](body: => T, alt: T): T
    Definition Classes
    ParserCommon
    Annotations
    @inline()
  77. final def inBracesOrNil[T](body: => List[T]): List[T]
    Definition Classes
    ParserCommon
    Annotations
    @inline()
  78. final def inBracesOrUnit[T](body: => Global.Tree): Global.Tree
    Definition Classes
    ParserCommon
    Annotations
    @inline()
  79. final def inBrackets[T](body: => T): T
    Definition Classes
    ParserCommon
    Annotations
    @inline()
  80. final def inGroupers[T](left: Parsers.Token)(body: => T): T

    Methods inParensOrError and similar take a second argument which, should the next token not be the expected opener (e.g.

    Methods inParensOrError and similar take a second argument which, should the next token not be the expected opener (e.g. LPAREN) will be returned instead of the contents of the groupers. However in all cases accept(LPAREN) will be called, so a parse error will still result. If the grouping is optional, in.token should be tested before calling these methods.

    Skip trailing comma is pushed down to scanner because this abstract parser doesn't have token info.

    Definition Classes
    ParserCommon
    Annotations
    @inline()
  81. final def inParens[T](body: => T): T
    Definition Classes
    ParserCommon
    Annotations
    @inline()
  82. final def inParensOrError[T](body: => T, alt: T): T
    Definition Classes
    ParserCommon
    Annotations
    @inline()
  83. final def inParensOrNil[T](body: => List[T]): List[T]
    Definition Classes
    ParserCommon
    Annotations
    @inline()
  84. final def inParensOrUnit[T](body: => Global.Tree): Global.Tree
    Definition Classes
    ParserCommon
    Annotations
    @inline()
  85. def isAnnotation: Boolean
  86. def isCaseDefEnd: Boolean
  87. def isDclIntro: Boolean
  88. def isDefIntro: Boolean
  89. def isExprIntro: Boolean
  90. def isExprIntroToken(token: Parsers.Token): Boolean
  91. def isIdent: Boolean
  92. def isIdentExcept(except: Global.Name): Boolean
  93. def isIdentOf(name: Global.Name): Boolean
  94. def isLiteral: Boolean
  95. def isLiteralToken(token: Parsers.Token): Boolean
  96. def isLocalModifier: Boolean
  97. def isMacro: Boolean
  98. def isModifier: Boolean
  99. def isNumericLit: Boolean
  100. def isRawBar: Boolean
  101. def isRawIdent: Boolean
  102. def isRawStar: Boolean
  103. def isScala3WildcardType: Boolean
  104. def isSoftModifier: Boolean
  105. def isStatSep: Boolean
  106. def isStatSep(token: Parsers.Token): Boolean
  107. def isStatSeqEnd: Boolean
  108. def isTemplateIntro: Boolean
  109. def isTypeIntroToken(token: Parsers.Token): Boolean
  110. def isTypedParam(t: Global.Tree): Boolean
  111. def isUnaryOp: Boolean
  112. def isValidSoftModifier: Boolean

    Is the current token a soft modifier in a position where such a modifier is allowed?

  113. final def isWildcard(t: Global.Tree): Boolean
    Annotations
    @tailrec()
  114. def isWildcardType: Boolean
  115. def joinComment(trees: => List[Global.Tree]): List[Global.Tree]

    A hook for joining the comment associated with a definition.

    A hook for joining the comment associated with a definition. Overridden by scaladoc.

  116. def literal(isNegated: Boolean = false, inPattern: Boolean = false, start: Parsers.Offset = in.offset): Global.Tree

    SimpleExpr    ::= literal
                | symbol
                | null
  117. def localDef(implicitMod: Long): List[Global.Tree]

    overridable IDE hook for local definitions of blockStatSeq Here's an idea how to fill in start and end positions.

    overridable IDE hook for local definitions of blockStatSeq Here's an idea how to fill in start and end positions. def localDef : List[Tree] = { atEndPos { atStartPos(in.offset) { val annots = annotations(skipNewLines = true) val mods = localModifiers() withAnnotations annots if (!(mods hasFlag ~(Flags.IMPLICIT | Flags.LAZY))) defOrDcl(mods) else List(tmplDef(mods)) } } (in.offset) }

  118. def localModifiers(): Global.Modifiers

    LocalModifiers ::= {LocalModifier}
LocalModifier  ::= abstract | final | sealed | implicit | lazy
  119. final def lookingAhead[T](body: => T): T

    Scoping operator used to temporarily look into the future.

    Scoping operator used to temporarily look into the future. Backs up scanner data before evaluating a block and restores it after.

    Annotations
    @inline()
  120. def makeBinop(isExpr: Boolean, left: Global.Tree, op: Global.TermName, right: Global.Tree, opPos: Global.Position, targs: List[Global.Tree] = Nil): Global.Tree

    Create tree representing (unencoded) binary operation expression or pattern.

  121. def makeEmptyPackage(start: Parsers.Offset, stats: List[Global.Tree]): Global.PackageDef
  122. def makeFilter(start: Parsers.Offset, tree: Global.Tree): Global.Apply
  123. def makePackaging(start: Parsers.Offset, pkg: Global.Tree, stats: List[Global.Tree]): Global.PackageDef

    Create a tree representing a packaging.

  124. final def makeParens(body: => List[Global.Tree]): Global.Parens

    Creates an actual Parens node (only used during parsing.)

    Creates an actual Parens node (only used during parsing.)

    Definition Classes
    ParserCommon
    Annotations
    @inline()
  125. def makeSafeFunctionType(argtpes: List[Global.Tree], restpe: Global.Tree): Global.Tree

    Create a function Tree.

    Create a function Tree. If the arity is not supported, a syntax error is emitted.

  126. def makeSafeTupleTerm(elems: List[Global.Tree]): Global.Tree

    Create a tuple term Tree.

    Create a tuple term Tree. If the arity is not supported, a syntax error is emitted.

  127. def makeSafeTupleType(elems: List[Global.Tree]): Global.Tree

    Create a tuple type Tree.

    Create a tuple type Tree. If the arity is not supported, a syntax error is emitted.

  128. def mixinQualifierOpt(): Global.TypeName

    MixinQualifier ::= `[` Id `]`
  129. def modifiers(): Global.Modifiers

    Modifiers ::= {Modifier}
Modifier  ::= LocalModifier
            |  AccessModifier
            |  override
  130. def multipleArgumentExprs(): List[List[Global.Tree]]

    A succession of argument lists.

  131. def newLineOpt(): Unit
  132. def newLineOptWhenFollowedBy(token: Parsers.Offset): Unit
  133. def newLineOptWhenFollowing(p: (Parsers.Token) => Boolean): Unit
  134. def newLinesOpt(): Unit
  135. final val noSeq: SeqContextSensitive

    The implementation for parsing inside of patterns at points where sequences are disallowed.

  136. def nonLocalDefOrDcl: List[Global.Tree]
  137. def o2p(offset: Parsers.Offset): Global.Position
  138. def objectDef(start: Parsers.Offset, mods: Global.Modifiers, isPackageObject: Boolean = false): Global.ModuleDef

    ObjectDef       ::= Id ClassTemplateOpt
  139. var opstack: List[OpInfo]
  140. final val outPattern: PatternContextSensitive

    The implementation of the context sensitive methods for parsing outside of patterns.

  141. def packageObjectDef(start: Parsers.Offset): Global.PackageDef

    Create a tree representing a package object, converting

    Create a tree representing a package object, converting

    package object foo { ... }

    to

    package foo {
  object `package` { ... }
}
  142. def packageOrPackageObject(start: Parsers.Offset): Global.Tree
  143. def param(owner: Global.Name, implicitmod: Long, caseParam: Boolean): Global.ValDef
  144. def paramClauses(owner: Global.Name, contextBounds: List[Global.Tree], ofCaseClass: Boolean): List[List[Global.ValDef]]

    ParamClauses      ::= {ParamClause} [[nl] `(` implicit Params `)`]
ParamClause       ::= [nl] `(` [Params] `)`
Params            ::= Param {`,` Param}
Param             ::= {Annotation} Id [`:` ParamType] [`=` Expr]
ClassParamClauses ::= {ClassParamClause} [[nl] `(` implicit ClassParams `)`]
ClassParamClause  ::= [nl] `(` [ClassParams] `)`
ClassParams       ::= ClassParam {`,` ClassParam}
ClassParam        ::= {Annotation}  [{Modifier} (`val` | `var`)] Id [`:` ParamType] [`=` Expr]
  145. def paramType(repeatedParameterOK: Boolean, useStartAsPosition: Boolean): Global.Tree
  146. def paramType(): Global.Tree

    ParamType ::= Type | `=>` Type | Type `*`
  147. def parse(): Global.Tree

    This is the general parse entry point.

  148. def parseRule[T](rule: (Parser.this.type) => T): T
  149. def parseStats(): List[Global.Tree]

    These are alternative entry points for repl, script runner, toolbox and parsing in macros.

  150. def parseStatsOrPackages(): List[Global.Tree]
  151. def patDefOrDcl(pos: Int, mods: Global.Modifiers): List[Global.Tree]

    PatDef ::= Pattern2 {`,` Pattern2} [`:` Type] `=` Expr
ValDcl ::= Id {`,` Id} `:` Type
VarDef ::= PatDef | Id {`,` Id} `:` Type `=` `_`
  152. def path(thisOK: Boolean, typeOK: Boolean): Global.Tree

    Path       ::= StableId
            |  [Ident `.`] this
AnnotType ::= Path [`.` type]
  153. def pattern(): Global.Tree

    Default entry points into some pattern contexts.

  154. var placeholderParams: List[Global.ValDef]

    The implicit parameters introduced by _ in the current expression.

    The implicit parameters introduced by _ in the current expression. Parameters appear in reverse order.

  155. def placeholderTypeBoundary(op: => Global.Tree): Global.Tree
  156. var placeholderTypes: List[Global.TypeDef]

    The placeholderTypes introduced by _ in the current type.

    The placeholderTypes introduced by _ in the current type. Parameters appear in reverse order.

  157. def postfixExpr(): Global.Tree

    PostfixExpr   ::= InfixExpr [Id [nl]]
InfixExpr     ::= PrefixExpr
                | InfixExpr Id [nl] InfixExpr
  158. def prefixExpr(): Global.Tree

    PrefixExpr   ::= [`-` | `+` | `~` | `!`] SimpleExpr
  159. def qualId(): Global.Tree

    QualId ::= Id {`.` Id}
  160. def r2p(offset: Parsers.Offset): Global.Position
  161. def r2p(start: Parsers.Offset, mid: Parsers.Offset): Global.Position
  162. def r2p(start: Parsers.Offset, mid: Parsers.Offset, end: Parsers.Offset): Global.Position
  163. def rawIdent(): Global.Name
  164. def readAnnots(part: => Global.Tree): List[Global.Tree]
  165. def reduceExprStack(base: List[OpInfo], top: Global.Tree): Global.Tree
  166. def reducePatternStack(base: List[OpInfo], top: Global.Tree): Global.Tree
  167. def reduceStack(isExpr: Boolean, base: List[OpInfo], top: Global.Tree, opPrecedence: Precedence, leftAssoc: Boolean): Global.Tree
  168. def reduceStack(isExpr: Boolean, base: List[OpInfo], top: Global.Tree): Global.Tree
  169. def refineStat(): List[Global.Tree]
  170. def refineStatSeq(): List[Global.Tree]

    RefineStatSeq    ::= RefineStat {semi RefineStat}
RefineStat       ::= Dcl
                   | type TypeDef
                   |
  171. def refinement(): List[Global.Tree]

    Refinement ::= [nl] `{` RefineStat {semi RefineStat} `}`
  172. def resetPackage(): Unit
  173. def scriptBody(): Global.Tree

    This is the parse entry point for code which is not self-contained, e.g.

    This is the parse entry point for code which is not self-contained, e.g. a script which is a series of template statements. They will be swaddled in Trees until the AST is equivalent to the one returned by compilationUnit().

  174. def selector(t0: Global.Tree): Global.Tree
  175. final def selectors(t: Global.Tree, typeOK: Boolean, dotOffset: Parsers.Offset): Global.Tree
    Annotations
    @tailrec()
  176. def selfInvocation(vparamss: List[List[Global.ValDef]]): Global.Tree

    SelfInvocation  ::= this ArgumentExprs {ArgumentExprs}
  177. final def separatedToken[T](separator: Parsers.Token, part: => T): List[T]

    .

    { `sep` part }

    . { sep part } }}}

    Definition Classes
    Parser → ParserCommon
  178. final val seqOK: SeqContextSensitive

    The implementation for parsing inside of patterns at points where sequences are allowed.

  179. def seqPatterns(): List[Global.Tree]
  180. def setInPos[T <: Global.Tree](t: T): T
  181. def simpleExpr(): Global.Tree

    SimpleExpr    ::= new (ClassTemplate | TemplateBody)
                |  BlockExpr
                |  SimpleExpr1 [`_`]
SimpleExpr1   ::= literal
                |  xLiteral
                |  Path
                |  `(` [Exprs] `)`
                |  SimpleExpr `.` Id
                |  SimpleExpr TypeArgs
                |  SimpleExpr1 ArgumentExprs
  182. final def simpleExprRest(t: Global.Tree, canApply: Boolean): Global.Tree
    Annotations
    @tailrec()
  183. def stableId(): Global.Tree

    StableId ::= Id
          |  Path `.` Id
          |  [id `.`] super [`[` id `]`]`.` id
  184. def startAnnotType(): Global.Tree
  185. def startInfixType(): Global.Tree
  186. def statSeq(stat: PartialFunction[Parsers.Token, List[Global.Tree]], errorMsg: String = "illegal start of definition"): List[Global.Tree]
  187. def statement(location: Location): Global.Tree
  188. def stripParens(t: Global.Tree): Global.Tree

    Strip the artificial Parens node to create a tuple term Tree.

  189. def syntaxError(offset: Parsers.Offset, msg: String, skipIt: Boolean): Unit
  190. def syntaxError(msg: String, skipIt: Boolean): Unit
  191. def syntaxErrorOrIncomplete(msg: String, skipIt: Boolean): Unit
  192. def syntaxErrorOrIncompleteAnd[T](msg: String, skipIt: Boolean)(and: T): T
  193. def template(): (List[Global.Tree], Global.ValDef, List[Global.Tree])

    ClassTemplate ::= [EarlyDefs with] ClassParents [TemplateBody]
TraitTemplate ::= [EarlyDefs with] TraitParents [TemplateBody]
EarlyDefs     ::= `{` [EarlyDef {semi EarlyDef}] `}`
EarlyDef      ::= Annotations Modifiers PatDef
  194. def templateBody(isPre: Boolean): (Global.ValDef, List[Global.Tree])

    TemplateBody ::= [nl] `{` TemplateStatSeq `}`
    isPre

    specifies whether in early initializer (true) or not (false)

  195. def templateBodyOpt(parenMeansSyntaxError: Boolean): (Global.ValDef, List[Global.Tree])
  196. def templateOpt(mods: Global.Modifiers, name: Global.Name, constrMods: Global.Modifiers, vparamss: List[List[Global.ValDef]], tstart: Parsers.Offset): Global.Template

    ClassTemplateOpt ::= `extends` ClassTemplate | [[`extends`] TemplateBody]
TraitTemplateOpt ::= TraitExtends TraitTemplate | [[TraitExtends] TemplateBody]
TraitExtends     ::= `extends` | `<:` (deprecated)
  197. def templateOrTopStatSeq(): List[Global.Tree]
  198. def templateParents(): List[Global.Tree]

    ClassParents       ::= AnnotType {`(` [Exprs] `)`} {with AnnotType}
TraitParents       ::= AnnotType {with AnnotType}
  199. def templateStat: PartialFunction[Parsers.Token, List[Global.Tree]]
  200. def templateStatSeq(isPre: Boolean): (Global.ValDef, List[Global.Tree])

    TemplateStatSeq  ::= [id [`:` Type] `=>`] TemplateStats
    isPre

    specifies whether in early initializer (true) or not (false)

  201. def templateStats(): List[Global.Tree]

    TemplateStats    ::= TemplateStat {semi TemplateStat}
TemplateStat     ::= Import
                   | Annotations Modifiers Def
                   | Annotations Modifiers Dcl
                   | Expr1
                   | super ArgumentExprs {ArgumentExprs}
                   |
  202. def tmplDef(pos: Parsers.Offset, mods: Global.Modifiers): Global.Tree

    TmplDef ::= [case] class ClassDef
          |  [case] object ObjectDef
          |  [override] trait TraitDef
  203. final def tokenSeparated[T](separator: Parsers.Token, part: => T): List[T]

    .

    part { `sep` part }

    . part { sep part } }}}

    Definition Classes
    Parser → ParserCommon
  204. def topLevelTmplDef: Global.Tree

    Hook for IDE, for top-level classes/objects.

  205. def topStat: PartialFunction[Parsers.Token, List[Global.Tree]]
  206. def topStatSeq(): List[Global.Tree]

    TopStatSeq ::= TopStat {semi TopStat}
TopStat ::= Annotations Modifiers TmplDef
          | Packaging
          | package object ObjectDef
          | Import
          |
  207. val treeBuilder: ParserTreeBuilder
  208. def typ(): Global.Tree

    These are default entry points into the pattern context sensitive methods: they are all initiated from non-pattern context.

  209. def typeBounds(): Global.TypeBoundsTree

    TypeBounds ::= [`>:` Type] [`<:` Type]
  210. def typeDefOrDcl(start: Parsers.Offset, mods: Global.Modifiers): Global.Tree

    TypeDef ::= type Id [TypeParamClause] `=` Type
          | FunSig `=` Expr
TypeDcl ::= type Id [TypeParamClause] TypeBounds
  211. def typeOrInfixType(location: Location): Global.Tree
  212. def typeParamClauseOpt(owner: Global.Name, contextBoundBuf: ListBuffer[Global.Tree], ownerKind: ParamOwner): List[Global.TypeDef]

    TypeParamClauseOpt    ::= [TypeParamClause]
TypeParamClause       ::= `[` VariantTypeParam {`,` VariantTypeParam} `]`]
VariantTypeParam      ::= {Annotation} [`+` | `-`] TypeParam
FunTypeParamClauseOpt ::= [FunTypeParamClause]
FunTypeParamClause    ::= `[` TypeParam {`,` TypeParam} `]`]
TypeParam             ::= Id TypeParamClauseOpt TypeBounds {`<%` Type} {`:` Type}
  213. def typedOpt(): Global.Tree

    TypedOpt ::= [`:` Type]
  214. def warning(msg: String, category: WarningCategory): Unit
  215. def wildImportSelector(): Global.ImportSelector
  216. def wildcardOrIdent(): Global.Name
  217. def wildcardType(start: Parsers.Offset, qmark: Boolean): Global.Ident

    WildcardType ::= `_` TypeBounds
  218. final val xmlSeqOK: SeqContextSensitive

    For use from xml pattern, where sequence is allowed and encouraged.

  219. def xmlSeqPatterns(): List[Global.Tree]
  220. object InfixMode extends Enumeration

    Modes for infix types.

Deprecated Value Members

  1. def precedence(operator: Global.Name): Int
    Annotations
    @deprecated
    Deprecated

    (Since version 2.11.0) Use scala.reflect.internal.Precedence