1
1
mirror of https://github.com/github/semantic.git synced 2024-12-23 06:41:45 +03:00
semantic/test/Data/Syntax/Assignment/Spec.hs

115 lines
5.6 KiB
Haskell
Raw Normal View History

2017-04-21 23:12:56 +03:00
{-# LANGUAGE DataKinds #-}
2017-04-07 19:21:45 +03:00
module Data.Syntax.Assignment.Spec where
2017-04-21 23:12:56 +03:00
import Data.ByteString.Char8 as B (words, length)
import Data.Record
2017-04-07 19:21:45 +03:00
import Data.Syntax.Assignment
2017-04-21 23:12:56 +03:00
import Info
import Prologue
2017-04-21 23:12:56 +03:00
import Source hiding (source, length)
import Test.Hspec
2017-04-18 18:06:24 +03:00
import Text.Parser.TreeSitter.Language (Symbol(..), SymbolType(..))
spec :: Spec
2017-04-06 20:36:54 +03:00
spec = do
2017-05-12 19:45:07 +03:00
describe "Applicative" $
2017-04-07 16:45:23 +03:00
it "matches in sequence" $
2017-06-08 03:17:14 +03:00
runAssignment headF ((,) <$> red <*> red) (makeState "helloworld" [node Red 0 5 [], node Red 5 10 []]) `shouldBe` Result Nothing (Just ((Out "hello", Out "world"), AssignmentState 10 (Info.SourcePos 1 11) "" []))
2017-04-07 21:47:23 +03:00
describe "Alternative" $ do
it "attempts multiple alternatives" $
2017-06-08 03:17:14 +03:00
runAssignment headF (green <|> red) (makeState "hello" [node Red 0 5 []]) `shouldBe` Result Nothing (Just (Out "hello", AssignmentState 5 (Info.SourcePos 1 6) "" []))
2017-04-07 21:47:23 +03:00
2017-04-07 16:45:23 +03:00
it "matches repetitions" $
2017-04-21 23:12:56 +03:00
let s = "colourless green ideas sleep furiously"
w = words s
(_, nodes) = foldl (\ (i, prev) word -> (i + B.length word + 1, prev <> [node Red i (i + B.length word) []])) (0, []) w in
2017-06-08 03:17:14 +03:00
resultValue (runAssignment headF (many red) (makeState (Source s) nodes)) `shouldBe` Just (Out <$> w, AssignmentState (B.length s) (Info.SourcePos 1 (succ (B.length s))) "" [])
2017-04-07 16:44:13 +03:00
2017-04-07 16:48:21 +03:00
it "matches one-or-more repetitions against one or more input nodes" $
2017-06-08 03:17:14 +03:00
resultValue (runAssignment headF (some red) (makeState "hello" [node Red 0 5 []])) `shouldBe` Just ([Out "hello"], AssignmentState 5 (Info.SourcePos 1 6) "" [])
2017-04-07 16:48:21 +03:00
2017-04-19 20:11:09 +03:00
describe "symbol" $ do
2017-04-07 21:50:57 +03:00
it "matches nodes with the same symbol" $
2017-06-08 03:17:14 +03:00
fst <$> runAssignment headF red (makeState "hello" [node Red 0 5 []]) `shouldBe` Result Nothing (Just (Out "hello"))
2017-04-07 21:50:57 +03:00
it "does not advance past the current node" $
let initialState = makeState "hi" [ node Red 0 2 [] ] in
2017-06-08 03:17:14 +03:00
snd <$> runAssignment headF (symbol Red) initialState `shouldBe` Result Nothing (Just initialState)
2017-04-19 23:00:44 +03:00
describe "source" $ do
it "produces the nodes source" $
2017-06-08 03:17:14 +03:00
assignBy headF source "hi" (node Red 0 2 []) `shouldBe` Result Nothing (Just "hi")
it "advances past the current node" $
2017-06-08 03:17:14 +03:00
snd <$> runAssignment headF source (makeState "hi" [ node Red 0 2 [] ]) `shouldBe` Result Nothing (Just (AssignmentState 2 (Info.SourcePos 1 3) "" []))
describe "children" $ do
it "advances past the current node" $
2017-06-08 03:17:14 +03:00
snd <$> runAssignment headF (children (pure (Out ""))) (makeState "a" [node Red 0 1 []]) `shouldBe` Result Nothing (Just (AssignmentState 1 (Info.SourcePos 1 2) "" []))
it "matches if its subrule matches" $
2017-06-08 03:17:14 +03:00
() <$ runAssignment headF (children red) (makeState "a" [node Blue 0 1 [node Red 0 1 []]]) `shouldBe` Result Nothing (Just ())
it "does not match if its subrule does not match" $
2017-06-08 03:17:14 +03:00
(runAssignment headF (children red) (makeState "a" [node Blue 0 1 [node Green 0 1 []]])) `shouldBe` Result (Just (Error (Info.SourcePos 1 1) (UnexpectedSymbol [Red] Green))) Nothing
2017-05-12 19:45:07 +03:00
it "matches nested children" $
2017-06-08 03:17:14 +03:00
runAssignment headF
2017-04-19 23:00:44 +03:00
(symbol Red *> children (symbol Green *> children (symbol Blue *> source)))
(makeState "1" [ node Red 0 1 [ node Green 0 1 [ node Blue 0 1 [] ] ] ])
2017-04-10 17:35:39 +03:00
`shouldBe`
2017-06-08 03:17:14 +03:00
Result Nothing (Just ("1", AssignmentState 1 (Info.SourcePos 1 2) "" []))
2017-04-10 17:35:39 +03:00
2017-05-12 19:45:07 +03:00
it "continues after children" $
2017-06-08 03:17:14 +03:00
resultValue (runAssignment headF
2017-04-19 23:00:44 +03:00
(many (symbol Red *> children (symbol Green *> source)
<|> symbol Blue *> source))
(makeState "BC" [ node Red 0 1 [ node Green 0 1 [] ]
, node Blue 1 2 [] ]))
`shouldBe`
2017-06-08 03:17:14 +03:00
Just (["B", "C"], AssignmentState 2 (Info.SourcePos 1 3) "" [])
2017-05-12 19:45:07 +03:00
it "matches multiple nested children" $
2017-06-08 03:17:14 +03:00
runAssignment headF
2017-04-19 23:00:44 +03:00
(symbol Red *> children (many (symbol Green *> children (symbol Blue *> source))))
(makeState "12" [ node Red 0 2 [ node Green 0 1 [ node Blue 0 1 [] ]
, node Green 1 2 [ node Blue 1 2 [] ] ] ])
`shouldBe`
2017-06-08 03:17:14 +03:00
Result Nothing (Just (["1", "2"], AssignmentState 2 (Info.SourcePos 1 3) "" []))
describe "runAssignment" $ do
2017-05-03 18:23:31 +03:00
it "drops anonymous nodes before matching symbols" $
2017-06-08 03:17:14 +03:00
runAssignment headF red (makeState "magenta red" [node Magenta 0 7 [], node Red 8 11 []]) `shouldBe` Result Nothing (Just (Out "red", AssignmentState 11 (Info.SourcePos 1 12) "" []))
it "does not drop anonymous nodes after matching" $
2017-06-08 03:17:14 +03:00
runAssignment headF red (makeState "red magenta" [node Red 0 3 [], node Magenta 4 11 []]) `shouldBe` Result Nothing (Just (Out "red", AssignmentState 3 (Info.SourcePos 1 4) " magenta" [node Magenta 4 11 []]))
2017-05-03 17:56:01 +03:00
it "does not drop anonymous nodes when requested" $
2017-06-08 03:17:14 +03:00
runAssignment headF ((,) <$> magenta <*> red) (makeState "magenta red" [node Magenta 0 7 [], node Red 8 11 []]) `shouldBe` Result Nothing (Just ((Out "magenta", Out "red"), AssignmentState 11 (Info.SourcePos 1 12) "" []))
node :: symbol -> Int -> Int -> [AST symbol] -> AST symbol
node symbol start end children = cofree $ (Just symbol :. Range start end :. Info.SourceSpan (Info.SourcePos 1 (succ start)) (Info.SourcePos 1 (succ end)) :. Nil) :< children
data Grammar = Red | Green | Blue | Magenta
deriving (Enum, Eq, Show)
2017-04-07 19:36:14 +03:00
2017-04-18 18:06:24 +03:00
instance Symbol Grammar where
symbolType Magenta = Anonymous
2017-04-18 18:06:24 +03:00
symbolType _ = Regular
2017-04-07 19:36:14 +03:00
data Out = Out ByteString
deriving (Eq, Show)
2017-06-08 03:17:14 +03:00
red :: Assignment (AST Grammar) Grammar Out
2017-04-19 23:00:44 +03:00
red = Out <$ symbol Red <*> source
2017-04-07 19:36:14 +03:00
2017-06-08 03:17:14 +03:00
green :: Assignment (AST Grammar) Grammar Out
2017-04-19 23:00:44 +03:00
green = Out <$ symbol Green <*> source
2017-04-07 19:36:14 +03:00
2017-06-08 03:17:14 +03:00
blue :: Assignment (AST Grammar) Grammar Out
2017-04-19 23:00:44 +03:00
blue = Out <$ symbol Blue <*> source
2017-06-08 03:17:14 +03:00
magenta :: Assignment (AST Grammar) Grammar Out
magenta = Out <$ symbol Magenta <*> source