Packages

abstract class Parser extends ParserCommon

Self Type
Parser
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Parser
  2. ParserCommon
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Parser()

Type Members

  1. class ParserTreeBuilder extends TreeBuilder
  2. 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. trait 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
    ParserParserCommon
  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): Unit
  9. abstract def xmlLiteral(): Global.Tree
  10. abstract def xmlLiteralPattern(): Global.Tree

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. 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
    ParserParserCommon
  5. def acceptStatSep(): Unit

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

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

    AccessQualifier ::= `[' (Id | this) `]'
  9. def annotTypeRest(t: Global.Tree): Global.Tree
  10. def annotationExpr(): Global.Tree
  11. def annotations(skipNewLines: Boolean): List[Global.Tree]

    Annotations      ::= {`@' SimpleType {ArgumentExprs}}
    ConsrAnnotations ::= {`@' SimpleType ArgumentExprs}
  12. def argumentExprs(): List[Global.Tree]

    ArgumentExprs ::= `(' [Exprs] `)'
                    | [nl] BlockExpr
  13. def argumentPatterns(): List[Global.Tree]
  14. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  15. val assumedClosingParens: Map[Int, Int]
  16. def atInPos[T <: Global.Tree](t: T): T
  17. def atPos[T <: Global.Tree](pos: Global.Position)(t: T): T
  18. def atPos[T <: Global.Tree](start: Parsers.Offset, point: Parsers.Offset, end: Parsers.Offset)(t: T): T
  19. def atPos[T <: Global.Tree](start: Parsers.Offset, point: Parsers.Offset)(t: T): T
  20. def atPos[T <: Global.Tree](offset: Parsers.Offset)(t: T): T
  21. def block(): Global.Tree

    Block ::= BlockStatSeq
    Note

    Return tree does not carry position.

  22. def blockExpr(): Global.Tree

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

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

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

    Check that type parameter is not by name or repeated.

  33. def classDef(start: Parsers.Offset, mods: Global.Modifiers): Global.ClassDef

    ClassDef ::= Id [TypeParamClause] {Annotation}
                 [AccessModifier] ClassParamClauses RequiresTypeOpt ClassTemplateOpt
    TraitDef ::= Id [TypeParamClause] RequiresTypeOpt TraitTemplateOpt
  34. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  35. final def commaSeparated[T](part: ⇒ T): List[T]
    Annotations
    @inline()
  36. def compilationUnit(): Global.PackageDef

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

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

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

    Convert tree to formal parameter.

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

    Convert tree to formal parameter list.

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

    Convert (qual)ident to type identifier.

  44. 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
  45. final def dropAnyBraces[T](body: ⇒ T): T
    Definition Classes
    ParserCommon
    Annotations
    @inline()
  46. def ensureEarlyDef(tree: Global.Tree): Global.Tree
  47. def enumerator(isFirst: Boolean, allowNestedIf: Boolean = true): List[Global.Tree]
  48. def enumerators(): List[Global.Tree]

    Enumerators ::= Generator {semi Enumerator}
    Enumerator  ::=  Generator
                  |  Guard
                  |  val Pattern1 `=' Expr
  49. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  50. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  51. def errorPatternTree: Global.Ident
  52. def errorTermTree: Global.Literal
  53. def errorTypeTree: Global.TypeTree
  54. def expectedMsg(token: Parsers.Token): String
  55. def expectedMsgTemplate(exp: String, fnd: String): String
  56. def expr(location: Location): Global.Tree
  57. 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}
                 | `:' `_' `*'
  58. def expr0(location: Location): Global.Tree
  59. def exprSimpleType(): Global.Tree
  60. def exprTypeArgs(): List[Global.Tree]
  61. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  62. def finishBinaryOp(isExpr: Boolean, opinfo: OpInfo, rhs: Global.Tree): Global.Tree
  63. def finishPostfixOp(start: Int, base: List[OpInfo], opinfo: OpInfo): Global.Tree
  64. implicit def fresh: FreshNameCreator
  65. 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
  66. def funDefRest(start: Parsers.Offset, nameOffset: Parsers.Offset, mods: Global.Modifiers, name: Global.Name): Global.Tree
  67. def generator(eqOK: Boolean, allowNestedIf: Boolean = true): List[Global.Tree]

    Generator ::= Pattern1 (`<-' | `=') Expr [Guard]
  68. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  69. def guard(): Global.Tree

    Guard ::= if PostfixExpr
  70. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  71. def ident(): Global.Name
  72. def ident(skipIt: Boolean): Global.Name

    Assumed (provisionally) to be TermNames.

  73. def identForType(skipIt: Boolean): Global.TypeName
  74. def identForType(): Global.TypeName

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

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

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

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

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

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

    ImportSelectors ::= `{' {ImportSelector `,'} (ImportSelector | `_') `}'
  81. final def inBraces[T](body: ⇒ T): T
    Definition Classes
    ParserCommon
    Annotations
    @inline()
  82. final def inBracesOrError[T](body: ⇒ T, alt: T): T
    Definition Classes
    ParserCommon
    Annotations
    @inline()
  83. final def inBracesOrNil[T](body: ⇒ List[T]): List[T]
    Definition Classes
    ParserCommon
    Annotations
    @inline()
  84. final def inBracesOrUnit[T](body: ⇒ Global.Tree): Global.Tree
    Definition Classes
    ParserCommon
    Annotations
    @inline()
  85. final def inBrackets[T](body: ⇒ T): T
    Definition Classes
    ParserCommon
    Annotations
    @inline()
  86. final def inParens[T](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.

    Definition Classes
    ParserCommon
    Annotations
    @inline()
  87. final def inParensOrError[T](body: ⇒ T, alt: T): T
    Definition Classes
    ParserCommon
    Annotations
    @inline()
  88. final def inParensOrNil[T](body: ⇒ List[T]): List[T]
    Definition Classes
    ParserCommon
    Annotations
    @inline()
  89. final def inParensOrUnit[T](body: ⇒ Global.Tree): Global.Tree
    Definition Classes
    ParserCommon
    Annotations
    @inline()
  90. def isAnnotation: Boolean
  91. def isCaseDefEnd: Boolean
  92. def isDclIntro: Boolean
  93. def isDefIntro: Boolean
  94. def isExprIntro: Boolean
  95. def isExprIntroToken(token: Parsers.Token): Boolean
  96. def isIdent: Boolean
  97. def isIdentExcept(except: Global.Name): Boolean
  98. def isIdentOf(name: Global.Name): Boolean
  99. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  100. def isLiteral: Boolean
  101. def isLiteralToken(token: Parsers.Token): Boolean
  102. def isLocalModifier: Boolean
  103. def isMacro: Boolean
  104. def isModifier: Boolean
  105. def isNumericLit: Boolean
  106. def isRawBar: Boolean
  107. def isRawIdent: Boolean
  108. def isRawStar: Boolean
  109. def isSimpleExprIntro: Boolean
  110. def isSimpleExprIntroToken(token: Parsers.Token): Boolean
  111. def isStatSep: Boolean
  112. def isStatSep(token: Parsers.Token): Boolean
  113. def isStatSeqEnd: Boolean
  114. def isTemplateIntro: Boolean
  115. def isTypeIntroToken(token: Parsers.Token): Boolean
  116. def isTypedParam(t: Global.Tree): Boolean
  117. def isUnaryOp: Boolean
  118. def isWildcard(t: Global.Tree): Boolean
  119. 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.

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

    SimpleExpr    ::= literal
                    | symbol
                    | null
  121. def localDef(implicitMod: Int): 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) }

  122. def localModifiers(): Global.Modifiers

    LocalModifiers ::= {LocalModifier}
    LocalModifier  ::= abstract | final | sealed | implicit | lazy
  123. 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()
  124. 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.

  125. def makeEmptyPackage(start: Parsers.Offset, stats: List[Global.Tree]): Global.PackageDef
  126. def makeFilter(start: Parsers.Offset, tree: Global.Tree): Global.Apply
  127. def makePackageObject(start: Parsers.Offset, objDef: Global.ModuleDef): Global.PackageDef
  128. def makePackaging(start: Parsers.Offset, pkg: Global.Tree, stats: List[Global.Tree]): Global.PackageDef

    Create a tree representing a packaging.

  129. 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()
  130. def makeSafeTupleTerm(elems: List[Global.Tree], offset: Parsers.Offset): Global.Tree

    Create a tuple term Tree.

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

  131. def makeSafeTupleType(elems: List[Global.Tree], offset: Parsers.Offset): Global.Tree

    Create a tuple type Tree.

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

  132. def mixinQualifierOpt(): Global.TypeName

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

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

    A succession of argument lists.

  135. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  136. def newLineOpt(): Unit
  137. def newLineOptWhenFollowedBy(token: Parsers.Offset): Unit
  138. def newLineOptWhenFollowing(p: (Parsers.Token) ⇒ Boolean): Unit
  139. def newLinesOpt(): Unit
  140. def nonLocalDefOrDcl: List[Global.Tree]
  141. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  142. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  143. def o2p(offset: Parsers.Offset): Global.Position
  144. def objectDef(start: Parsers.Offset, mods: Global.Modifiers): Global.ModuleDef

    ObjectDef       ::= Id ClassTemplateOpt
  145. var opstack: List[OpInfo]
  146. 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` { ... }
    }
  147. def packageOrPackageObject(start: Parsers.Offset): Global.Tree
  148. def param(owner: Global.Name, implicitmod: Int, caseParam: Boolean): Global.ValDef
  149. 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]
  150. def paramType(useStartAsPosition: Boolean): Global.Tree
  151. def paramType(): Global.Tree

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

    This is the general parse entry point.

  153. def parseRule[T](rule: (Parser.this.type) ⇒ T): T
  154. def parseStats(): List[Global.Tree]

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

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

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

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

    Default entry points into some pattern contexts.

  159. def peekingAhead(tree: ⇒ Global.Tree): Global.Tree

    Perform an operation while peeking ahead.

    Perform an operation while peeking ahead. Pushback if the operation yields an empty tree or blows to pieces.

    Annotations
    @inline()
  160. 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.

  161. def placeholderTypeBoundary(op: ⇒ Global.Tree): Global.Tree
  162. 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.

  163. def postfixExpr(): Global.Tree

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

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

    QualId ::= Id {`.' Id}
  166. def r2p(offset: Parsers.Offset): Global.Position
  167. def r2p(start: Parsers.Offset, mid: Parsers.Offset): Global.Position
  168. def r2p(start: Parsers.Offset, mid: Parsers.Offset, end: Parsers.Offset): Global.Position
  169. def rawIdent(): Global.Name
  170. def readAnnots(part: ⇒ Global.Tree): List[Global.Tree]
  171. def reduceExprStack(base: List[OpInfo], top: Global.Tree): Global.Tree
  172. def reducePatternStack(base: List[OpInfo], top: Global.Tree): Global.Tree
  173. def reduceStack(isExpr: Boolean, base: List[OpInfo], top: Global.Tree, opPrecedence: Precedence, leftAssoc: Boolean): Global.Tree
  174. def reduceStack(isExpr: Boolean, base: List[OpInfo], top: Global.Tree): Global.Tree
  175. def refineStat(): List[Global.Tree]
  176. def refineStatSeq(): List[Global.Tree]

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

    Refinement ::= [nl] `{' RefineStat {semi RefineStat} `}'
  178. def resetPackage(): Unit
  179. 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().

  180. def selector(t: Global.Tree): Global.Tree
  181. def selectors(t: Global.Tree, typeOK: Boolean, dotOffset: Parsers.Offset): Global.Tree
  182. def selfInvocation(vparamss: List[List[Global.ValDef]]): Global.Tree

    SelfInvocation  ::= this ArgumentExprs {ArgumentExprs}
  183. def seqPatterns(): List[Global.Tree]
  184. def setInPos[T <: Global.Tree](t: T): T
  185. def simpleExpr(): Global.Tree

    SimpleExpr    ::= new (ClassTemplate | TemplateBody)
                    |  BlockExpr
                    |  SimpleExpr1 [`_']
    SimpleExpr1   ::= literal
                    |  xLiteral
                    |  Path
                    |  `(' [Exprs] `)'
                    |  SimpleExpr `.' Id
                    |  SimpleExpr TypeArgs
                    |  SimpleExpr1 ArgumentExprs
  186. def simpleExprRest(t: Global.Tree, canApply: Boolean): Global.Tree
  187. def skip(targetToken: Parsers.Token): Unit
    Attributes
    protected
  188. def stableId(): Global.Tree

    StableId ::= Id
              |  Path `.' Id
              |  [id `.'] super [`[' id `]']`.' id
  189. def startAnnotType(): Global.Tree
  190. def startInfixType(): Global.Tree
  191. def statSeq(stat: PartialFunction[Parsers.Token, List[Global.Tree]], errorMsg: String = "illegal start of definition"): List[Global.Tree]
  192. def statement(location: Location): Global.Tree
  193. def stripParens(t: Global.Tree): Global.Tree

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

  194. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  195. def syntaxError(offset: Parsers.Offset, msg: String, skipIt: Boolean): Unit
  196. def syntaxError(msg: String, skipIt: Boolean): Unit
  197. def syntaxErrorOrIncomplete(msg: String, skipIt: Boolean): Unit
  198. def syntaxErrorOrIncompleteAnd[T](msg: String, skipIt: Boolean)(and: T): T
  199. 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
  200. def templateBody(isPre: Boolean): (Global.ValDef, List[Global.Tree])

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

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

  201. def templateBodyOpt(parenMeansSyntaxError: Boolean): (Global.ValDef, List[Global.Tree])
  202. 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)
  203. def templateOrTopStatSeq(): List[Global.Tree]
  204. def templateParents(): List[Global.Tree]

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

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

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

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

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

    TmplDef ::= [case] class ClassDef
              |  [case] object ObjectDef
              |  [override] trait TraitDef
  209. def toString(): String
    Definition Classes
    AnyRef → Any
  210. final def tokenSeparated[T](separator: Parsers.Token, sepFirst: Boolean, part: ⇒ T): List[T]

    ,or if sepFirst is true,

    part { `sep` part }

    ,or if sepFirst is true,

    { `sep` part }

    . { sep part } }}} part { sep part } }}}

  211. def topLevelTmplDef: Global.Tree

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

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

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

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

  216. def typeBounds(): Global.TypeBoundsTree

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

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

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

    TypedOpt ::= [`:' Type]
  221. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  222. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  223. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  224. def warning(msg: String): Unit
  225. def wildcardOrIdent(): Global.Name
  226. def wildcardType(start: Parsers.Offset): Global.Ident

    WildcardType ::= `_' TypeBounds
  227. def xmlSeqPatterns(): List[Global.Tree]
  228. object InfixMode extends Enumeration

    Modes for infix types.

  229. object noSeq extends SeqContextSensitive

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

  230. object outPattern extends PatternContextSensitive

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

  231. object seqOK extends SeqContextSensitive

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

  232. object xmlSeqOK extends SeqContextSensitive

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

Deprecated Value Members

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

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

Inherited from Parsers.ParserCommon

Inherited from AnyRef

Inherited from Any

Ungrouped