github/semantic
1
1
Fork 0
mirror of https://github.com/github/semantic.git synced 2024-12-23 14:54:16 +03:00
Code Issues Projects Releases Wiki Activity

Define small-step semantics for assignment.

Browse Source
This commit is contained in:
Rob Rix 2017-04-05 21:16:09 -04:00
parent bca1bf08d8
commit ddba2b53cd
1 changed files with 15 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
src/Language/Ruby/Syntax.hs
View File

@ -74,3 +74,18 @@ data Node grammar = Node { nodeSymbol :: grammar, nodeContent :: ByteString }
-- | An abstract syntax tree. -- | An abstract syntax tree.
type AST grammar = Rose (Node grammar) type AST grammar = Rose (Node grammar)
stepAssignment :: Eq grammar => Assignment grammar a -> [AST grammar] -> Maybe ([AST grammar], a)
stepAssignment = iterFreer (\ assignment yield nodes -> case nodes of
[] -> Nothing
Rose Node{..} children : rest -> case assignment of
Rule symbol subRule ->
if symbol == nodeSymbol then
yield subRule nodes
else
Nothing
Content -> yield nodeContent rest
Children each -> yield (snd (forEach children)) rest
where forEach rest = case stepAssignment each rest of
Just (rest, x) -> let (rest', xs) = forEach rest in (rest', x : xs)
Nothing -> (rest, [])
Fail -> Nothing) . fmap ((Just .) . flip (,))