forked from GitHub/gf-core
71 lines
2.3 KiB
Plaintext
71 lines
2.3 KiB
Plaintext
resource ResImper = {
|
|
|
|
-- precedence
|
|
|
|
param
|
|
Prec = P0 | P1 | P2 | P3 ;
|
|
oper
|
|
PrecExp : Type = {s : Prec => Str} ;
|
|
ex : PrecExp -> Str = \exp -> exp.s ! P0 ;
|
|
constant : Str -> PrecExp = \c -> {s = \\_ => c} ;
|
|
infixN : Prec -> Str -> PrecExp -> PrecExp -> PrecExp = \p,f,x,y ->
|
|
{s = \\k => mkPrec (x.s ! (nextPrec ! p) ++ f ++ y.s ! (nextPrec ! p)) ! p ! k} ;
|
|
infixL : Prec -> Str -> PrecExp -> PrecExp -> PrecExp = \p,f,x,y ->
|
|
{s = mkPrec (x.s ! p ++ f ++ y.s ! (nextPrec ! p)) ! p} ;
|
|
|
|
nextPrec : Prec => Prec = table {P0 => P1 ; P1 => P2 ; _ => P3} ;
|
|
mkPrec : Str -> Prec => Prec => Str = \str -> table {
|
|
P3 => table { -- use the term of precedence P3...
|
|
_ => str} ; -- ...always without parentheses
|
|
P2 => table { -- use the term of precedence P2...
|
|
P3 => paren str ; -- ...in parentheses if P3 is expected...
|
|
_ => str} ; -- ...otherwise without parentheses
|
|
P1 => table {
|
|
P3 | P2 => paren str ;
|
|
_ => str} ;
|
|
P0 => table {
|
|
P0 => str ;
|
|
_ => paren str}
|
|
} ;
|
|
|
|
-- string operations
|
|
|
|
SS : Type = {s : Str} ;
|
|
ss : Str -> SS = \s -> {s = s} ;
|
|
cc2 : (_,_ : SS) -> SS = \x,y -> ss (x.s ++ y.s) ;
|
|
|
|
paren : Str -> Str = \str -> "(" ++ str ++ ")" ;
|
|
|
|
continues : Str -> SS -> SS = \s,t -> ss (s ++ ";" ++ t.s) ;
|
|
continue : Str -> SS -> SS = \s,t -> ss (s ++ t.s) ;
|
|
statement : Str -> SS = \s -> ss (s ++ ";");
|
|
|
|
-- taking cases of list size
|
|
|
|
param
|
|
Size = Zero | One | More ;
|
|
oper
|
|
nextSize : Size -> Size = \n -> case n of {
|
|
Zero => One ;
|
|
_ => More
|
|
} ;
|
|
separator : Str -> Size -> Str = \t,n -> case n of {
|
|
Zero => [] ;
|
|
_ => t
|
|
} ;
|
|
|
|
-- operations for JVM
|
|
|
|
Instr : Type = {s,s2,s3 : Str} ; -- code, variables, labels
|
|
instr : Str -> Instr = \s ->
|
|
statement s ** {s2,s3 = []} ;
|
|
instrc : Str -> Instr -> Instr = \s,i ->
|
|
ss (s ++ ";" ++ i.s) ** {s2 = i.s2 ; s3 = i.s3} ;
|
|
instrl : Str -> Instr -> Instr = \s,i ->
|
|
ss (s ++ ";" ++ i.s) ** {s2 = i.s2 ; s3 = "L" ++ i.s3} ;
|
|
instrb : Str -> Str -> Instr -> Instr = \v,s,i ->
|
|
ss (s ++ ";" ++ i.s) ** {s2 = v ++ i.s2 ; s3 = i.s3} ;
|
|
binop : Str -> SS -> SS -> SS = \op, x, y ->
|
|
ss (x.s ++ y.s ++ op ++ ";") ;
|
|
}
|