cb44ac2 · rowtype-yoga/purescript-native

examples/Objects.ps+2−2

compare with golang

unifiedsplit

@@ -4,6 +4,6 @@ append = \o -> { foo: o.foo, bar: 1 }

4

5apTest = append({foo : "Foo", baz: "Baz"})

6

7−f = (\a -> (a.b).c)({ b: { c: 1, d: "Hello" }, e: "World" })

7+f = (\a -> a.b.c)({ b: { c: 1, d: "Hello" }, e: "World" })

8

9−g = (\a -> (a.f)({ x: 1, y: "y" }))({ f: \o -> o.x + 1 })

9+g = (\a -> a.f({ x: 1, y: "y" }))({ f: \o -> o.x + 1 })

examples/Operators.ps+1−1

@@ -1,6 +1,6 @@

1test1 = \x, y, z -> x * y + z(x)(y)

2

3−test2 = (\x -> (x.foo)(false))({ foo : \_ -> 1 })

3+test2 = (\x -> x.foo(false))({ foo : \_ -> 1 })

4

5test3 = (\x, y -> x)(1 + 2 * (1 + 2), true && (false || false))

6

examples/TypeSynonyms.ps+4−4

@@ -5,9 +5,9 @@ type Lens a b =

5

6composeLenses :: forall a b c. (Lens a b) -> (Lens b c) -> Lens a c

7composeLenses = \l1 -> \l2 ->

8− { get: \a -> (l2.get)((l1.get)(a))

8+ { get: \a -> l2.get(l1.get(a))

9 , set: \a -> \c -> do

10− var b = (l1.get)(a)

10+ var b = l1.get(a)

11− var b1 = (l2.set)(b)(c)

11+ var b1 = l2.set(b)(c)

12− return (l1.set)(a)(b1)

12+ return l1.set(a)(b1)

13 }

src/PureScript/Parser/Common.hs+3

@@ -138,6 +138,9 @@ fold first more combine = do

138 bs <- P.many more

139 return $ foldl combine a bs

140

141+buildPostfixParser :: P.Stream s m t => [P.ParsecT s u m (a -> a)] -> P.ParsecT s u m a -> P.ParsecT s u m a

142+buildPostfixParser f x = fold x (P.choice (map P.try f)) (flip ($))

143+

141parseIdent :: P.Parsec String u Ident

144parseIdent :: P.Parsec String u Ident

142parseIdent = (Ident <$> identifier) <|> (Op <$> parens operator)

145parseIdent = (Ident <$> identifier) <|> (Op <$> parens operator)

143

146

src/PureScript/Parser/Values.hs+6−7

@@ -95,14 +95,13 @@ parseValueAtom = C.indented *> P.choice (map P.try

95 , C.parens parseValue ])

96

97parseValue :: P.Parsec String P.Column Value

98−parseValue = buildExpressionParser operators $ C.fold (C.lexeme typedValue) (C.lexeme funArgs) App

98+parseValue = buildExpressionParser operators . C.buildPostfixParser postfixTable $ parseValueAtom

99 where

100− typedValue = C.augment parseValueAtom parseTypeAnnotation TypedValue

100+ postfixTable = [ Accessor <$> (C.indented *> C.dot *> C.indented *> C.identifier)

101+ , Indexer <$> (C.indented *> C.squares parseValue)

101− funArgs = C.indented *> C.parens (parseValue `P.sepBy` (C.indented *> C.comma))

102+ , flip App <$> (C.indented *> C.parens (parseValue `P.sepBy` (C.indented *> C.comma)))

102− parseTypeAnnotation = P.try $ C.lexeme (C.indented *> P.string "::") *> parsePolyType

103+ , flip TypedValue <$> (P.try $ C.lexeme (C.indented *> P.string "::") *> parsePolyType) ]

103− operators = [ [ Postfix $ Accessor <$> (C.indented *> C.dot *> C.indented *> C.identifier)

104− , Postfix $ Indexer <$> (C.indented *> C.squares parseValue) ]

105− , [ Prefix $ C.lexeme (P.try $ C.indented *> C.reservedOp "!") >> return (Unary Not)

104+ operators = [ [ Prefix $ C.lexeme (P.try $ C.indented *> C.reservedOp "!") >> return (Unary Not)

106 , Prefix $ C.lexeme (P.try $ C.indented *> C.reservedOp "~") >> return (Unary BitwiseNot)

105 , Prefix $ C.lexeme (P.try $ C.indented *> C.reservedOp "~") >> return (Unary BitwiseNot)

107 , Prefix $ C.lexeme (P.try $ C.indented *> C.reservedOp "-") >> return (Unary Negate) ]

106 , Prefix $ C.lexeme (P.try $ C.indented *> C.reservedOp "-") >> return (Unary Negate) ]

108 , [ Infix (C.lexeme (P.try (C.indented *> C.parseIdentInfix) >>= \ident -> return $ \t1 t2 -> App (App (Var ident) [t1]) [t2])) AssocRight ]

107 , [ Infix (C.lexeme (P.try (C.indented *> C.parseIdentInfix) >>= \ident -> return $ \t1 t2 -> App (App (Var ident) [t1]) [t2])) AssocRight ]