Agda
Safe HaskellNone
LanguageHaskell2010

Agda.Syntax.Parser.Tokens

Synopsis

Documentation

data Token Source #

Bundled Patterns

pattern TokQual :: QualifiableToken -> [(Interval, String)] -> Interval -> Token 

Instances

Instances details
HasRange Token Source # 
Instance details

Defined in Agda.Syntax.Parser.Tokens

Methods

getRange :: Token -> Range Source #

HasRangeWithoutFile Token Source # 
Instance details

Defined in Agda.Syntax.Parser.Tokens

Show Token Source # 
Instance details

Defined in Agda.Syntax.Parser.Tokens

Methods

showsPrec :: Int -> Token -> ShowS #

show :: Token -> String #

showList :: [Token] -> ShowS #

Eq Token Source # 
Instance details

Defined in Agda.Syntax.Parser.Tokens

Methods

(==) :: Token -> Token -> Bool #

(/=) :: Token -> Token -> Bool #

data QualifiableToken Source #

Tokens which may appear qualified.

Constructors

QualDo

qualified do

QualEmptyIdiom

qualified (|) or ⦇⦈

QualOpenIdiom Bool

qualified (| or , True if unicode

data QualifiedToken Source #

A "qualified token", i.e. a sequence of (module) names followed by one of the allowed (QualifiableToken) keywords/symbols.

Constructors

QualifiedToken 

Fields

layoutKeywords :: [Keyword] Source #

Unconditional layout keywords.

Some keywords introduce layout only in certain circumstances, these are not included here.

data Symbol Source #

Instances

Instances details
Show Symbol Source # 
Instance details

Defined in Agda.Syntax.Parser.Tokens

Eq Symbol Source # 
Instance details

Defined in Agda.Syntax.Parser.Tokens

Methods

(==) :: Symbol -> Symbol -> Bool #

(/=) :: Symbol -> Symbol -> Bool #