module Idents (Ident, noARNum, isLegalIdent, lexemeToIdent, internalIdent,
onlyPosIdent, cloneIdent, identToLexeme, isIdentSimple,
isIdentPrim, stripIdentARNum, getIdentARNum, newIdentARNum,
getIdentAttrs, dumpIdent)
where
import Data.Char
import Position (Position, Pos(posOf), nopos)
import UNames (Name)
import Errors (interr)
import Attributes (Attrs, newAttrsOnlyPos, newAttrs,
Attributed(attrsOf), posOfAttrsOf)
import Binary (Binary(..), putSharedString, getSharedString)
data Ident = Ident String
!Int
!Int
!Attrs
instance Eq Ident where
(Ident [Char]
s Int
k Int
id Attrs
_) == :: Ident -> Ident -> Bool
== (Ident [Char]
s' Int
k' Int
id' Attrs
_) = (Int
k Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
k')
Bool -> Bool -> Bool
&& (Int
id Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
id')
Bool -> Bool -> Bool
&& ([Char]
s [Char] -> [Char] -> Bool
forall a. Eq a => a -> a -> Bool
== [Char]
s')
instance Ord Ident where
(Ident [Char]
s Int
k Int
id Attrs
_) < :: Ident -> Ident -> Bool
< (Ident [Char]
s' Int
k' Int
id' Attrs
_) = (Int
k Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
< Int
k')
Bool -> Bool -> Bool
|| ((Int
k Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
k') Bool -> Bool -> Bool
&& (Int
id Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
< Int
id'))
Bool -> Bool -> Bool
|| ((Int
k Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
k') Bool -> Bool -> Bool
&& (Int
id Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
id')
Bool -> Bool -> Bool
&& ([Char]
s [Char] -> [Char] -> Bool
forall a. Ord a => a -> a -> Bool
< [Char]
s'))
Ident
id1 <= :: Ident -> Ident -> Bool
<= Ident
id2 = (Ident
id1 Ident -> Ident -> Bool
forall a. Ord a => a -> a -> Bool
< Ident
id2) Bool -> Bool -> Bool
|| (Ident
id1 Ident -> Ident -> Bool
forall a. Eq a => a -> a -> Bool
== Ident
id2)
instance Show Ident where
showsPrec :: Int -> Ident -> ShowS
showsPrec Int
_ Ident
ide = [Char] -> ShowS
showString ([Char]
"`" [Char] -> ShowS
forall a. [a] -> [a] -> [a]
++ Ident -> [Char]
identToLexeme Ident
ide [Char] -> ShowS
forall a. [a] -> [a] -> [a]
++ [Char]
"'")
instance Attributed Ident where
attrsOf :: Ident -> Attrs
attrsOf (Ident [Char]
_ Int
_ Int
_ Attrs
at) = Attrs
at
instance Pos Ident where
posOf :: Ident -> Position
posOf = Ident -> Position
forall a. Attributed a => a -> Position
posOfAttrsOf
quad :: String -> Int
quad :: [Char] -> Int
quad (Char
c1:Char
c2:Char
c3:Char
c4:[Char]
s) = ((Char -> Int
ord Char
c4 Int -> Int -> Int
forall a. Num a => a -> a -> a
* Int
bits21
Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Char -> Int
ord Char
c3 Int -> Int -> Int
forall a. Num a => a -> a -> a
* Int
bits14
Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Char -> Int
ord Char
c2 Int -> Int -> Int
forall a. Num a => a -> a -> a
* Int
bits7
Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Char -> Int
ord Char
c1)
Int -> Int -> Int
forall a. Integral a => a -> a -> a
`mod` Int
bits28)
Int -> Int -> Int
forall a. Num a => a -> a -> a
+ ([Char] -> Int
quad [Char]
s Int -> Int -> Int
forall a. Integral a => a -> a -> a
`mod` Int
bits28)
quad (Char
c1:Char
c2:Char
c3:[] ) = Char -> Int
ord Char
c3 Int -> Int -> Int
forall a. Num a => a -> a -> a
* Int
bits14 Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Char -> Int
ord Char
c2 Int -> Int -> Int
forall a. Num a => a -> a -> a
* Int
bits7 Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Char -> Int
ord Char
c1
quad (Char
c1:Char
c2:[] ) = Char -> Int
ord Char
c2 Int -> Int -> Int
forall a. Num a => a -> a -> a
* Int
bits7 Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Char -> Int
ord Char
c1
quad (Char
c1:[] ) = Char -> Int
ord Char
c1
quad ([] ) = Int
0
bits7 :: Int
bits7 = Int
2Int -> Integer -> Int
forall a b. (Num a, Integral b) => a -> b -> a
^Integer
7
bits14 :: Int
bits14 = Int
2Int -> Integer -> Int
forall a b. (Num a, Integral b) => a -> b -> a
^Integer
14
bits21 :: Int
bits21 = Int
2Int -> Integer -> Int
forall a b. (Num a, Integral b) => a -> b -> a
^Integer
21
bits28 :: Int
bits28 = Int
2Int -> Integer -> Int
forall a b. (Num a, Integral b) => a -> b -> a
^Integer
28
noARNum :: Int
noARNum :: Int
noARNum = -Int
1
primARNum :: Int
primARNum :: Int
primARNum = -Int
2
internARNum :: Int
internARNum :: Int
internARNum = -Int
3
isLegalIdent :: String -> Bool
isLegalIdent :: [Char] -> Bool
isLegalIdent [] = Bool
False
isLegalIdent (Char
c:[Char]
cs) = if Char
c Char -> Char -> Bool
forall a. Eq a => a -> a -> Bool
== Char
'`' then [Char] -> Bool
isQualIdent [Char]
cs
else (Char -> Bool
isAlpha Char
c Bool -> Bool -> Bool
|| Char
c Char -> Char -> Bool
forall a. Eq a => a -> a -> Bool
== Char
'_') Bool -> Bool -> Bool
&& [Char] -> Bool
isIdent (Char
cChar -> ShowS
forall a. a -> [a] -> [a]
:[Char]
cs)
where
isIdent :: [Char] -> Bool
isIdent = [Char] -> Bool
checkTail ([Char] -> Bool) -> ShowS -> [Char] -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ((Char -> Bool) -> ShowS
forall a. (a -> Bool) -> [a] -> [a]
dropWhile Char -> Bool
isAlphaNumOrUS)
checkTail :: [Char] -> Bool
checkTail [] = Bool
True
checkTail ([Char]
"##") = Bool
True
checkTail (Char
'#':[Char]
cs') = (Char -> Bool) -> [Char] -> Bool
forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
all Char -> Bool
isDigit [Char]
cs'
checkTail [Char]
_ = Bool
False
isAlphaNumOrUS :: Char -> Bool
isAlphaNumOrUS Char
c = Char -> Bool
isAlphaNum Char
c Bool -> Bool -> Bool
|| (Char
c Char -> Char -> Bool
forall a. Eq a => a -> a -> Bool
== Char
'_')
isAlphaNum :: Char -> Bool
isAlphaNum Char
c = Char -> Bool
isAlpha Char
c Bool -> Bool -> Bool
|| Char -> Bool
isNum Char
c
isAlpha :: Char -> Bool
isAlpha Char
c = Char
c Char -> [Char] -> Bool
forall a. Eq a => a -> [a] -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
`elem` [Char
'a'..Char
'z'] [Char] -> ShowS
forall a. [a] -> [a] -> [a]
++ [Char
'A'..Char
'Z']
isNum :: Char -> Bool
isNum Char
c = Char
c Char -> [Char] -> Bool
forall a. Eq a => a -> [a] -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
`elem` [Char
'0'..Char
'9']
isQualIdent :: [Char] -> Bool
isQualIdent [Char]
cs = let
cs' :: [Char]
cs' = ShowS
skip [Char]
cs
in
(Bool -> Bool
not (Bool -> Bool) -> ([Char] -> Bool) -> [Char] -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. [Char] -> Bool
forall a. [a] -> Bool
forall (t :: * -> *) a. Foldable t => t a -> Bool
null) [Char]
cs'
Bool -> Bool -> Bool
&& ([Char] -> Bool
checkTail ([Char] -> Bool) -> ShowS -> [Char] -> Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ShowS
forall a. HasCallStack => [a] -> [a]
tail) [Char]
cs'
skip :: ShowS
skip [] = []
skip (Char
'\'':[Char]
cs) = Char
'\''Char -> ShowS
forall a. a -> [a] -> [a]
:[Char]
cs
skip (Char
'\\':[Char]
cs) = case [Char]
cs of
(Char
'\'':[Char]
cs') -> ShowS
skip [Char]
cs'
(Char
'\\':[Char]
cs') -> ShowS
skip [Char]
cs'
[Char]
_ -> ShowS
skip [Char]
cs
skip (Char
c :[Char]
cs) = ShowS
skip [Char]
cs
lexemeToIdent :: Position -> String -> Name -> Ident
lexemeToIdent :: Position -> [Char] -> Name -> Ident
lexemeToIdent Position
pos [Char]
l Name
name = [Char] -> Int -> Int -> Attrs -> Ident
Ident [Char]
s Int
k ([Char] -> Int
quad [Char]
s) (Position -> Name -> Attrs
newAttrs Position
pos Name
name)
where
([Char]
s, Int
k) = Position -> [Char] -> ([Char], Int)
parseIdent Position
pos [Char]
l
internalIdent :: String -> Ident
internalIdent :: [Char] -> Ident
internalIdent [Char]
s = [Char] -> Int -> Int -> Attrs -> Ident
Ident [Char]
s Int
internARNum ([Char] -> Int
quad [Char]
s) (Position -> Attrs
newAttrsOnlyPos Position
nopos)
onlyPosIdent :: Position -> String -> Ident
onlyPosIdent :: Position -> [Char] -> Ident
onlyPosIdent Position
pos [Char]
l = [Char] -> Int -> Int -> Attrs -> Ident
Ident [Char]
s Int
k ([Char] -> Int
quad [Char]
s) (Position -> Attrs
newAttrsOnlyPos Position
pos)
where
([Char]
s, Int
k) = Position -> [Char] -> ([Char], Int)
parseIdent Position
pos [Char]
l
parseIdent :: Position -> String -> (String, Int)
parseIdent :: Position -> [Char] -> ([Char], Int)
parseIdent Position
pos [Char]
l
= if ([Char] -> Bool
forall a. [a] -> Bool
forall (t :: * -> *) a. Foldable t => t a -> Bool
null [Char]
l)
then
[Char] -> ([Char], Int)
forall a. [Char] -> a
interr ([Char] -> ([Char], Int)) -> [Char] -> ([Char], Int)
forall a b. (a -> b) -> a -> b
$ [Char]
"Idents: lexemeToIdent: Empty lexeme! " [Char] -> ShowS
forall a. [a] -> [a] -> [a]
++ Position -> [Char]
forall a. Show a => a -> [Char]
show Position
pos
else
if ([Char] -> Char
forall a. HasCallStack => [a] -> a
head [Char]
l Char -> Char -> Bool
forall a. Eq a => a -> a -> Bool
== Char
'\'')
then
[Char] -> ([Char], Int)
parseQuoted (ShowS
forall a. HasCallStack => [a] -> [a]
tail [Char]
l)
else
[Char] -> ([Char], Int)
parseNorm [Char]
l
where
parseNorm :: [Char] -> ([Char], Int)
parseNorm [] = ([], Int
noARNum)
parseNorm ([Char]
"##") = ([], Int
primARNum)
parseNorm (Char
'#':[Char]
cs) = ([], (([Char] -> Int
forall a. Read a => [Char] -> a
read ([Char] -> Int) -> ShowS -> [Char] -> Int
forall b c a. (b -> c) -> (a -> b) -> a -> c
. ShowS
check) [Char]
cs)::Int)
parseNorm (Char
c :[Char]
cs) = let
([Char]
cs', Int
k) = [Char] -> ([Char], Int)
parseNorm [Char]
cs
in
(Char
cChar -> ShowS
forall a. a -> [a] -> [a]
:[Char]
cs', Int
k)
check :: ShowS
check [] = ShowS
forall a. [Char] -> a
interr [Char]
"Idents: lexemeToIdent: Missing\
\ number!"
check (Char
'-':[Char]
cs) = ShowS
forall a. [Char] -> a
interr [Char]
"Idents: lexemeToIdent: Illegal\
\ negative number!"
check [Char]
s = [Char]
s
parseQuoted :: [Char] -> ([Char], Int)
parseQuoted [] = [Char] -> ([Char], Int)
forall a. [Char] -> a
interr [Char]
endInQuotes
parseQuoted (Char
'\\':[Char]
cs) = [Char] -> ([Char], Int)
parseSpecial [Char]
cs
parseQuoted (Char
'\'':[Char]
cs) = let
([Char]
rmd, Int
k) = [Char] -> ([Char], Int)
parseNorm [Char]
cs
in
if ([Char] -> Bool
forall a. [a] -> Bool
forall (t :: * -> *) a. Foldable t => t a -> Bool
null [Char]
rmd) then ([], Int
k)
else [Char] -> ([Char], Int)
forall a. [Char] -> a
interr [Char]
afterQuotes
parseQuoted (Char
c :[Char]
cs) = let
([Char]
cs', Int
k) = [Char] -> ([Char], Int)
parseQuoted [Char]
cs
in
(Char
cChar -> ShowS
forall a. a -> [a] -> [a]
:[Char]
cs', Int
k)
endInQuotes :: [Char]
endInQuotes = [Char]
"Idents: lexemeToIdent: Unexpected end of\
\ lexeme (in quotes)!"
afterQuotes :: [Char]
afterQuotes = [Char]
"Idents: lexemeToIdent: Superfluous\
\ characters after quotes!"
endInSpecial :: [Char]
endInSpecial = [Char]
"Idents: lexemeToIdent: Unexpected end of\
\ lexeme (in escape sequence)!"
illegalSpecial :: [Char]
illegalSpecial = [Char]
"Idents: lexemeToIdent: Illegal escape\
\ sequence!"
parseSpecial :: [Char] -> ([Char], Int)
parseSpecial [] = [Char] -> ([Char], Int)
forall a. [Char] -> a
interr [Char]
endInSpecial
parseSpecial (Char
c1:Char
c2:Char
c3:[Char]
cs)
| Char -> Bool
isDigit Char
c1
Bool -> Bool -> Bool
&& Char -> Bool
isDigit Char
c2
Bool -> Bool -> Bool
&& Char -> Bool
isDigit Char
c3 = let
([Char]
cs', Int
k) = [Char] -> ([Char], Int)
parseQuoted [Char]
cs
ord0 :: Int
ord0 = Char -> Int
ord Char
'0'
d1 :: Int
d1 = Char -> Int
ord Char
c1 Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
ord0
d2 :: Int
d2 = Char -> Int
ord Char
c2 Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
ord0
d3 :: Int
d3 = Char -> Int
ord Char
c3 Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
ord0
in
(Int -> Char
chr (Int
100Int -> Int -> Int
forall a. Num a => a -> a -> a
*Int
d1 Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
10Int -> Int -> Int
forall a. Num a => a -> a -> a
*Int
d2 Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
d3)
Char -> ShowS
forall a. a -> [a] -> [a]
:[Char]
cs', Int
k)
parseSpecial (Char
c:[Char]
cs)
| Char
c Char -> Char -> Bool
forall a. Eq a => a -> a -> Bool
== Char
'\\' = (Char
'\\'Char -> ShowS
forall a. a -> [a] -> [a]
:[Char]
cs', Int
k)
| Char
c Char -> Char -> Bool
forall a. Eq a => a -> a -> Bool
== Char
'\"' = (Char
'\"'Char -> ShowS
forall a. a -> [a] -> [a]
:[Char]
cs', Int
k)
| Char
c Char -> Char -> Bool
forall a. Eq a => a -> a -> Bool
== Char
'\'' = (Char
'\''Char -> ShowS
forall a. a -> [a] -> [a]
:[Char]
cs', Int
k)
| Char
c Char -> Char -> Bool
forall a. Eq a => a -> a -> Bool
== Char
'n' = (Char
'\n'Char -> ShowS
forall a. a -> [a] -> [a]
:[Char]
cs', Int
k)
| Char
c Char -> Char -> Bool
forall a. Eq a => a -> a -> Bool
== Char
't' = (Char
'\t'Char -> ShowS
forall a. a -> [a] -> [a]
:[Char]
cs', Int
k)
| Char
c Char -> Char -> Bool
forall a. Eq a => a -> a -> Bool
== Char
'r' = (Char
'\r'Char -> ShowS
forall a. a -> [a] -> [a]
:[Char]
cs', Int
k)
where
([Char]
cs', Int
k) = [Char] -> ([Char], Int)
parseQuoted [Char]
cs
parseSpecial [Char]
_ = [Char] -> ([Char], Int)
forall a. [Char] -> a
interr [Char]
illegalSpecial
cloneIdent :: Ident -> Name -> Ident
cloneIdent :: Ident -> Name -> Ident
cloneIdent (Ident [Char]
s Int
k Int
idnum Attrs
at) Name
name =
[Char] -> Int -> Int -> Attrs -> Ident
Ident [Char]
s Int
k Int
idnum (Position -> Name -> Attrs
newAttrs (Attrs -> Position
forall a. Pos a => a -> Position
posOf Attrs
at) Name
name)
identToLexeme :: Ident -> String
identToLexeme :: Ident -> [Char]
identToLexeme (Ident [Char]
s Int
k Int
_ Attrs
_) = [Char]
s [Char] -> ShowS
forall a. [a] -> [a] -> [a]
++ [Char]
suffix
where
suffix :: [Char]
suffix = if (Int
k Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
noARNum)
then [Char]
""
else if (Int
k Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
primARNum)
then [Char]
"##"
else if (Int
k Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
internARNum)
then [Char]
"<internal>"
else [Char]
"#" [Char] -> ShowS
forall a. [a] -> [a] -> [a]
++ Int -> [Char]
forall a. Show a => a -> [Char]
show Int
k
isIdentSimple :: Ident -> Bool
isIdentSimple :: Ident -> Bool
isIdentSimple (Ident [Char]
_ Int
k Int
_ Attrs
_) = Int
k Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
noARNum
isIdentPrim :: Ident -> Bool
isIdentPrim :: Ident -> Bool
isIdentPrim (Ident [Char]
_ Int
k Int
_ Attrs
_) = Int
k Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
primARNum
stripIdentARNum :: Ident -> Ident
stripIdentARNum :: Ident -> Ident
stripIdentARNum (Ident [Char]
s Int
k Int
id Attrs
at)
| Int
k Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
primARNum Bool -> Bool -> Bool
|| Int
k Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
internARNum = [Char] -> Ident
forall a. [Char] -> a
interr [Char]
"Idents: stripIdentARNum: \
\Not allowed!"
| Bool
otherwise = [Char] -> Int -> Int -> Attrs -> Ident
Ident [Char]
s Int
noARNum Int
id Attrs
at
getIdentARNum :: Ident -> Int
getIdentARNum :: Ident -> Int
getIdentARNum (Ident [Char]
s Int
k Int
id Attrs
at)
| Int
k Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
primARNum Bool -> Bool -> Bool
|| Int
k Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
internARNum = [Char] -> Int
forall a. [Char] -> a
interr [Char]
"Idents: getIdentARNum: \
\Not allowed!"
| Bool
otherwise = Int
k
newIdentARNum :: Ident -> Int -> Ident
newIdentARNum :: Ident -> Int -> Ident
newIdentARNum (Ident [Char]
s Int
k Int
id Attrs
at) Int
k'
| Int
k' Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
< Int
0 = [Char] -> Ident
forall a. [Char] -> a
interr [Char]
"Idents: newIdentARNum: \
\Negative number!"
| Int
k Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
primARNum Bool -> Bool -> Bool
|| Int
k Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
internARNum = [Char] -> Ident
forall a. [Char] -> a
interr [Char]
"Idents: newIdentARNum: \
\Not allowed!"
| Bool
otherwise = [Char] -> Int -> Int -> Attrs -> Ident
Ident [Char]
s Int
k' Int
id Attrs
at
getIdentAttrs :: Ident -> Attrs
getIdentAttrs :: Ident -> Attrs
getIdentAttrs (Ident [Char]
_ Int
_ Int
_ Attrs
as) = Attrs
as
dumpIdent :: Ident -> String
dumpIdent :: Ident -> [Char]
dumpIdent Ident
ide = Ident -> [Char]
identToLexeme Ident
ide [Char] -> ShowS
forall a. [a] -> [a] -> [a]
++ [Char]
" at " [Char] -> ShowS
forall a. [a] -> [a] -> [a]
++ Position -> [Char]
forall a. Show a => a -> [Char]
show (Ident -> Position
forall a. Pos a => a -> Position
posOf Ident
ide)
instance Binary Ident where
put_ :: BinHandle -> Ident -> IO ()
put_ BinHandle
bh (Ident [Char]
aa Int
ab Int
ac Attrs
ad) = do
BinHandle -> [Char] -> IO ()
putSharedString BinHandle
bh [Char]
aa
BinHandle -> Int -> IO ()
forall a. Binary a => BinHandle -> a -> IO ()
put_ BinHandle
bh Int
ab
BinHandle -> Int -> IO ()
forall a. Binary a => BinHandle -> a -> IO ()
put_ BinHandle
bh Int
ac
BinHandle -> Attrs -> IO ()
forall a. Binary a => BinHandle -> a -> IO ()
put_ BinHandle
bh Attrs
ad
get :: BinHandle -> IO Ident
get BinHandle
bh = do
aa <- BinHandle -> IO [Char]
getSharedString BinHandle
bh
ab <- get bh
ac <- get bh
ad <- get bh
return (Ident aa ab ac ad)