github/semantic
1
1
Fork 0
mirror of https://github.com/github/semantic.git synced 2024-12-22 22:31:36 +03:00
Code Issues Projects Releases Wiki Activity

Can have binary statement of empty expressions

Browse Source
This commit is contained in:
Timothy Clem 2017-08-01 15:25:28 -07:00
parent da51cb3c20
commit 473e7e34dd
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -351,7 +351,7 @@ unary = symbol Unary >>= \ location ->
<|> makeTerm location . Expression.Negate <$> children expression -- Unary minus (e.g. `-a`). HiddenUnaryMinus nodes are hidden, so we can't match on the symbol. <|> makeTerm location . Expression.Negate <$> children expression -- Unary minus (e.g. `-a`). HiddenUnaryMinus nodes are hidden, so we can't match on the symbol.
binary :: Assignment binary :: Assignment
binary = symbol Binary >>= \ loc -> children $ expression >>= \ lexpression -> go loc lexpression binary = symbol Binary >>= \ loc -> children $ (expression <|> emptyTerm) >>= \ lexpression -> go loc lexpression
where where
go loc lexpression go loc lexpression
= mk AnonAnd Expression.And = mk AnonAnd Expression.And