BNFC.Lex

Documentation

alex_tab_size :: Int

alex_base :: AlexAddr

alex_table :: AlexAddr

alex_check :: AlexAddr

alex_deflt :: AlexAddr

alex_accept :: Array Int (AlexAcc user)

alex_actions :: Array Int (Posn -> String -> Token)

alexIndexInt32OffAddr :: AlexAddr -> Int# -> Int#

quickIndex :: Array Int (AlexAcc (Any :: Type)) -> Int -> AlexAcc (Any :: Type)

data AlexReturn a

Constructors

AlexEOF

AlexError !AlexInput

AlexSkip !AlexInput !Int

AlexToken !AlexInput !Int a

alexScan :: (Posn, Char, [Byte], String) -> Int -> AlexReturn (Posn -> String -> Token)

alexScanUser :: t -> (Posn, Char, [Byte], String) -> Int -> AlexReturn (Posn -> String -> Token)

alex_scan_tkn :: t1 -> t2 -> Int# -> AlexInput -> Int# -> AlexLastAcc -> (AlexLastAcc, (Posn, Char, [Byte], String))

data AlexLastAcc

Constructors

AlexNone

AlexLastAcc !Int !AlexInput !Int

AlexLastSkip !AlexInput !Int

data AlexAcc user

Constructors

AlexAccNone

AlexAcc Int

AlexAccSkip

tok :: (String -> Tok) -> Posn -> String -> Token

Create a token with position.

data Tok

Token without position.

Constructors

TK !TokSymbol

Reserved word or symbol.

TL !String

String literal.

TI !String

Integer literal.

TV !String

Identifier.

TD !String

Float literal.

TC !String

Character literal.

T_Identifier !String

Instances

Eq Tok

Defined in BNFC.Lex

Methods

(==) :: Tok -> Tok -> Bool

(/=) :: Tok -> Tok -> Bool

Ord Tok

Defined in BNFC.Lex

Methods

compare :: Tok -> Tok -> Ordering

(<) :: Tok -> Tok -> Bool

(<=) :: Tok -> Tok -> Bool

(>) :: Tok -> Tok -> Bool

(>=) :: Tok -> Tok -> Bool

max :: Tok -> Tok -> Tok

min :: Tok -> Tok -> Tok

Show Tok

Defined in BNFC.Lex

Methods

showsPrec :: Int -> Tok -> ShowS

show :: Tok -> String

showList :: [Tok] -> ShowS

pattern TS :: String -> Int -> Tok

Smart constructor for Tok for the sake of backwards compatibility.

data TokSymbol

Keyword or symbol tokens have a unique ID.

Constructors

TokSymbol

Fields

• tsText :: String

  Keyword or symbol text.

• tsID :: !Int

  Unique ID.

Instances

Eq TokSymbol

Keyword/symbol equality is determined by the unique ID.

Defined in BNFC.Lex

Methods

(==) :: TokSymbol -> TokSymbol -> Bool

(/=) :: TokSymbol -> TokSymbol -> Bool

Ord TokSymbol

Keyword/symbol ordering is determined by the unique ID.

Defined in BNFC.Lex

Methods

compare :: TokSymbol -> TokSymbol -> Ordering

(<) :: TokSymbol -> TokSymbol -> Bool

(<=) :: TokSymbol -> TokSymbol -> Bool

(>) :: TokSymbol -> TokSymbol -> Bool

(>=) :: TokSymbol -> TokSymbol -> Bool

max :: TokSymbol -> TokSymbol -> TokSymbol

min :: TokSymbol -> TokSymbol -> TokSymbol

Show TokSymbol

Defined in BNFC.Lex

Methods

showsPrec :: Int -> TokSymbol -> ShowS

show :: TokSymbol -> String

showList :: [TokSymbol] -> ShowS

data Token

Token with position.

Constructors

PT Posn Tok

Err Posn

Instances

Eq Token

Defined in BNFC.Lex

Methods

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

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

Ord Token

Defined in BNFC.Lex

Methods

compare :: Token -> Token -> Ordering

(<) :: Token -> Token -> Bool

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

(>) :: Token -> Token -> Bool

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

max :: Token -> Token -> Token

min :: Token -> Token -> Token

Show Token

Defined in BNFC.Lex

Methods

showsPrec :: Int -> Token -> ShowS

show :: Token -> String

showList :: [Token] -> ShowS

printPosn :: Posn -> String

Pretty print a position.

tokenPos :: [Token] -> String

Pretty print the position of the first token in the list.

tokenPosn :: Token -> Posn

Get the position of a token.

tokenLineCol :: Token -> (Int, Int)

Get line and column of a token.

posLineCol :: Posn -> (Int, Int)

Get line and column of a position.

mkPosToken :: Token -> ((Int, Int), String)

Convert a token into "position token" form.

tokenText :: Token -> String

Convert a token to its text.

prToken :: Token -> String

Convert a token to a string.

data BTree

Finite map from text to token organized as binary search tree.

Constructors

N

Nil (leaf).

B String Tok BTree BTree

Binary node.

Instances

Show BTree

Defined in BNFC.Lex

Methods

showsPrec :: Int -> BTree -> ShowS

show :: BTree -> String

showList :: [BTree] -> ShowS

eitherResIdent :: (String -> Tok) -> String -> Tok

Convert potential keyword into token or use fallback conversion.

resWords :: BTree

The keywords and symbols of the language organized as binary search tree.

unescapeInitTail :: String -> String

Unquote string literal.

data Posn

Constructors

Pn !Int !Int !Int

Instances

Eq Posn

Defined in BNFC.Lex

Methods

(==) :: Posn -> Posn -> Bool

(/=) :: Posn -> Posn -> Bool

Ord Posn

Defined in BNFC.Lex

Methods

compare :: Posn -> Posn -> Ordering

(<) :: Posn -> Posn -> Bool

(<=) :: Posn -> Posn -> Bool

(>) :: Posn -> Posn -> Bool

(>=) :: Posn -> Posn -> Bool

max :: Posn -> Posn -> Posn

min :: Posn -> Posn -> Posn

Show Posn

Defined in BNFC.Lex

Methods

showsPrec :: Int -> Posn -> ShowS

show :: Posn -> String

showList :: [Posn] -> ShowS

alexStartPos :: Posn

alexMove :: Posn -> Char -> Posn

type Byte = Word8

type AlexInput = (Posn, Char, [Byte], String)

tokens :: String -> [Token]

alexGetByte :: AlexInput -> Maybe (Byte, AlexInput)

alexInputPrevChar :: AlexInput -> Char

utf8Encode :: Char -> [Word8]

Encode a Haskell String to a list of Word8 values, in UTF8 format.

alex_action_3 :: Posn -> String -> Token

alex_action_4 :: Posn -> String -> Token

alex_action_5 :: Posn -> String -> Token

alex_action_6 :: Posn -> String -> Token

alex_action_7 :: Posn -> String -> Token

alex_action_8 :: Posn -> String -> Token

alex_action_9 :: Posn -> String -> Token

data AlexAddr

Constructors

AlexA# Addr#

alexIndexInt16OffAddr :: AlexAddr -> Int# -> Int#