ModuleBNFC-2.9.6.3Haskell2010
BNFC.Lex
Synopsis
- value alex_tab_size
- value alex_base
- value alex_table
- value alex_check
- value alex_deflt
- value alex_accept
- value alex_actions
- value alex_action_3
- value alex_action_4
- value alex_action_5
- value alex_action_6
- value alex_action_7
- value alex_action_8
- value alex_action_9
- data AlexAddr
- value alexIndexInt16OffAddr
- value alexIndexInt32OffAddr
- value quickIndex
- data AlexReturn
- value alexScan
- value alexScanUser
- value alex_scan_tkn
- data AlexLastAcc
- data AlexAcc
- value tok
- data Tok
- pattern TS
- data TokSymbol
- data Token
- value printPosn
- value tokenPos
- value tokenPosn
- value tokenLineCol
- value posLineCol
- value mkPosToken
- value tokenText
- value prToken
- data BTree
- value eitherResIdent
- value resWords
- value unescapeInitTail
- data Posn
- value alexStartPos
- value alexMove
- type Byte
- type AlexInput
- value tokens
- value alexGetByte
- value alexInputPrevChar
- value utf8Encode
- PackageBNFC-2.9.6.3
- Exports50
- LanguageHaskell2010
- LicenceBSD-3-Clause
- SourceLex.x
Constructors
Constructors
Create a token with position.
Token without position.
Smart constructor for Tok for the sake of backwards compatibility.
Keyword or symbol tokens have a unique ID.
Pretty print a position.
Pretty print the position of the first token in the list.
Get the position of a token.
Get line and column of a token.
Get line and column of a position.
Convert a token into "position token" form.
Convert a token to its text.
Convert a token to a string.
Finite map from text to token organized as binary search tree.
Convert potential keyword into token or use fallback conversion.
The keywords and symbols of the language organized as binary search tree.
Unquote string literal.
Encode a Haskell String to a list of Word8 values, in UTF8 format.