2019-03-04 08:58:00 +01:00
|
|
|
{- sv2v
|
|
|
|
|
- Author: Zachary Snow <zach@zachjs.com>
|
|
|
|
|
-
|
|
|
|
|
- Advanced parser for declarations and module instantiations.
|
|
|
|
|
-
|
|
|
|
|
- This module exists because the SystemVerilog grammar has conflicts which
|
|
|
|
|
- cannot be resolved by an LALR(1) parser. This module provides an interface
|
|
|
|
|
- for parsing an list of "DeclTokens" into `Decl`s and/or `ModuleItem`s. This
|
|
|
|
|
- works through a series of functions which have an greater lookahead for
|
|
|
|
|
- resolving the conflicts.
|
|
|
|
|
-
|
|
|
|
|
- Consider the following two module declarations:
|
|
|
|
|
- module Test(one two, three [1:0], four);
|
|
|
|
|
- module Test(one two, three [1:0] four);
|
|
|
|
|
-
|
|
|
|
|
- When `{one} two ,` is on the stack, it is impossible to know whether to A)
|
|
|
|
|
- shift `three` to add to the current declaration list; or B) to reduce the
|
|
|
|
|
- stack and begin a new port declaration; without looking ahead more than 1
|
|
|
|
|
- token (even ignoring the fact that a range is itself multiple tokens).
|
|
|
|
|
-
|
|
|
|
|
- While I previous had some success dealing with conflicts in the parser with
|
|
|
|
|
- increasingly convoluted grammars, this became more and more untenable as I
|
|
|
|
|
- added support for more SystemVerilog constructs.
|
|
|
|
|
-
|
|
|
|
|
- Because of how liberal this parser is, the parser will accept some
|
|
|
|
|
- syntactically invalid files. In the future, we may add some basic
|
|
|
|
|
- type-checking to complain about malformed input files. However, we generally
|
|
|
|
|
- assume that users have tested their code with commercial simulator before
|
|
|
|
|
- running it through our tool.
|
|
|
|
|
-}
|
|
|
|
|
|
|
|
|
|
module Language.SystemVerilog.Parser.ParseDecl
|
|
|
|
|
( DeclToken (..)
|
|
|
|
|
, parseDTsAsPortDecls
|
|
|
|
|
, parseDTsAsModuleItems
|
|
|
|
|
, parseDTsAsDecls
|
|
|
|
|
, parseDTsAsDecl
|
2019-03-04 20:25:38 +01:00
|
|
|
, parseDTsAsDeclOrAsgn
|
2019-03-04 08:58:00 +01:00
|
|
|
) where
|
|
|
|
|
|
|
|
|
|
import Data.List (findIndices)
|
|
|
|
|
import Data.Maybe (mapMaybe)
|
|
|
|
|
|
|
|
|
|
import Language.SystemVerilog.AST
|
|
|
|
|
|
|
|
|
|
-- [PUBLIC]: combined (irregular) tokens for declarations
|
|
|
|
|
data DeclToken
|
|
|
|
|
= DTComma
|
|
|
|
|
| DTAsgn Expr
|
2019-03-04 20:25:38 +01:00
|
|
|
| DTAsgnNBlk Expr
|
2019-03-04 08:58:00 +01:00
|
|
|
| DTRange Range
|
|
|
|
|
| DTIdent Identifier
|
|
|
|
|
| DTDir Direction
|
|
|
|
|
| DTType ([Range] -> Type)
|
|
|
|
|
| DTParams [PortBinding]
|
|
|
|
|
| DTInstance (Identifier, Maybe [PortBinding])
|
2019-03-04 20:25:38 +01:00
|
|
|
| DTBit Expr
|
|
|
|
|
| DTConcat [LHS]
|
2019-03-04 08:58:00 +01:00
|
|
|
deriving (Show, Eq)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
-- [PUBLIC]: parser for module port declarations, including interface ports
|
|
|
|
|
-- Example: `input foo, bar, One inst`
|
|
|
|
|
parseDTsAsPortDecls :: [DeclToken] -> ([Identifier], [ModuleItem])
|
|
|
|
|
parseDTsAsPortDecls pieces =
|
|
|
|
|
if isSimpleList
|
|
|
|
|
then (simpleIdents, [])
|
|
|
|
|
else (portNames declarations, map MIDecl declarations)
|
|
|
|
|
where
|
|
|
|
|
commaIdxs = findIndices isComma pieces
|
|
|
|
|
identIdxs = findIndices isIdent pieces
|
|
|
|
|
isSimpleList =
|
|
|
|
|
all even identIdxs &&
|
|
|
|
|
all odd commaIdxs &&
|
|
|
|
|
odd (length pieces) &&
|
|
|
|
|
length pieces == length commaIdxs + length identIdxs
|
|
|
|
|
|
|
|
|
|
simpleIdents = map extractIdent $ filter isIdent pieces
|
|
|
|
|
declarations = parseDTsAsDecls pieces
|
|
|
|
|
|
|
|
|
|
isComma :: DeclToken -> Bool
|
|
|
|
|
isComma token = token == DTComma
|
|
|
|
|
extractIdent = \(DTIdent x) -> x
|
|
|
|
|
|
|
|
|
|
portNames :: [Decl] -> [Identifier]
|
|
|
|
|
portNames items = mapMaybe portName items
|
|
|
|
|
portName :: Decl -> Maybe Identifier
|
|
|
|
|
portName (Variable _ _ ident _ _) = Just ident
|
|
|
|
|
portName decl =
|
|
|
|
|
error $ "unexpected non-variable port declaration: " ++ (show decl)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
-- [PUBLIC]: parser for single (semicolon-terminated) declarations (including
|
|
|
|
|
-- parameters) and module instantiations
|
|
|
|
|
parseDTsAsModuleItems :: [DeclToken] -> [ModuleItem]
|
|
|
|
|
parseDTsAsModuleItems tokens =
|
|
|
|
|
if any isInstance tokens
|
|
|
|
|
then parseDTsAsIntantiations tokens
|
|
|
|
|
else map MIDecl $ parseDTsAsDecl tokens
|
|
|
|
|
where
|
|
|
|
|
isInstance :: DeclToken -> Bool
|
|
|
|
|
isInstance (DTInstance _) = True
|
|
|
|
|
isInstance _ = False
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
-- internal; parser for module instantiations
|
|
|
|
|
parseDTsAsIntantiations :: [DeclToken] -> [ModuleItem]
|
|
|
|
|
parseDTsAsIntantiations (DTIdent name : tokens) =
|
|
|
|
|
if not (all isInstance rest)
|
|
|
|
|
then error $ "instantiations mixed with other items: " ++ (show rest)
|
|
|
|
|
else map (uncurry $ Instance name params) instances
|
|
|
|
|
where
|
|
|
|
|
(params, rest) =
|
|
|
|
|
case head tokens of
|
|
|
|
|
DTParams ps -> (ps, tail tokens)
|
|
|
|
|
_ -> ([], tokens)
|
|
|
|
|
instances = map (\(DTInstance inst) -> inst) rest
|
|
|
|
|
isInstance :: DeclToken -> Bool
|
|
|
|
|
isInstance (DTInstance _) = True
|
|
|
|
|
isInstance _ = False
|
|
|
|
|
parseDTsAsIntantiations tokens =
|
|
|
|
|
error $
|
|
|
|
|
"DeclTokens contain instantiations, but start with non-ident: "
|
|
|
|
|
++ (show tokens)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
-- [PUBLIC]: parser for generic, comma-separated declarations
|
|
|
|
|
parseDTsAsDecls :: [DeclToken] -> [Decl]
|
|
|
|
|
parseDTsAsDecls tokens =
|
|
|
|
|
concat $ map finalize $ parseDTsAsComponents tokens
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
-- [PUBLIC]: used for "single" declarations, i.e., declarations appearing
|
|
|
|
|
-- outside of a port list
|
|
|
|
|
parseDTsAsDecl :: [DeclToken] -> [Decl]
|
|
|
|
|
parseDTsAsDecl tokens =
|
|
|
|
|
if length components /= 1
|
|
|
|
|
then error $ "too many declarations: " ++ (show tokens)
|
|
|
|
|
else finalize $ head components
|
|
|
|
|
where components = parseDTsAsComponents tokens
|
|
|
|
|
|
|
|
|
|
|
2019-03-04 20:25:38 +01:00
|
|
|
-- [PUBLIC]: parser for single block item declarations of assign statetments
|
|
|
|
|
parseDTsAsDeclOrAsgn :: [DeclToken] -> ([Decl], [Stmt])
|
|
|
|
|
parseDTsAsDeclOrAsgn tokens =
|
|
|
|
|
if any isAsgnToken tokens || tripLookahead tokens
|
|
|
|
|
then ([], [constructor lhs expr])
|
|
|
|
|
else (parseDTsAsDecl tokens, [])
|
|
|
|
|
where
|
|
|
|
|
(constructor, expr) = case last tokens of
|
|
|
|
|
DTAsgn e -> (AsgnBlk, e)
|
|
|
|
|
DTAsgnNBlk e -> (Asgn , e)
|
|
|
|
|
_ -> error $ "invalid block item decl or stmt: " ++ (show tokens)
|
|
|
|
|
(lhs, []) = takeLHS $ init tokens
|
|
|
|
|
isAsgnToken :: DeclToken -> Bool
|
|
|
|
|
isAsgnToken (DTBit _) = True
|
|
|
|
|
isAsgnToken (DTConcat _) = True
|
|
|
|
|
isAsgnToken _ = False
|
|
|
|
|
|
|
|
|
|
-- TODO: It looks like our LHS type doesn't represent the full set of possible
|
|
|
|
|
-- LHSs, i.e., `foo[0][0]` isn't representable. When this is addressed, we'll
|
|
|
|
|
-- have to take another pass at this function. It will probably need to be
|
|
|
|
|
-- recursive.
|
|
|
|
|
takeLHS :: [DeclToken] -> (LHS, [DeclToken])
|
|
|
|
|
takeLHS (DTConcat lhss : rest) = (LHSConcat lhss, rest)
|
|
|
|
|
takeLHS (DTIdent x : DTBit e : rest) = (LHSBit x e , rest)
|
|
|
|
|
takeLHS (DTIdent x : DTRange r : rest) = (LHSRange x r , rest)
|
|
|
|
|
takeLHS (DTIdent x : rest) = (LHS x , rest)
|
|
|
|
|
takeLHS (DTType tf : rest) =
|
|
|
|
|
case tf [] of
|
|
|
|
|
InterfaceT x (Just y) [] -> (LHSDot (LHS x) y, rest)
|
|
|
|
|
_ -> error $ "unexpected type in assignment: " ++ (show tf)
|
|
|
|
|
takeLHS tokens = error $ "missing LHS in assignment: " ++ (show tokens)
|
|
|
|
|
|
|
|
|
|
|
2019-03-04 08:58:00 +01:00
|
|
|
-- batches together seperate declaration lists
|
|
|
|
|
type Triplet = (Identifier, [Range], Maybe Expr)
|
|
|
|
|
type Component = (Direction, Type, [Triplet])
|
|
|
|
|
finalize :: Component -> [Decl]
|
|
|
|
|
finalize (dir, typ, trips) =
|
|
|
|
|
map (\(x, a, me) -> Variable dir typ x a me) trips
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
-- internal; entrypoint of the critical portion of our parser
|
|
|
|
|
parseDTsAsComponents :: [DeclToken] -> [Component]
|
|
|
|
|
parseDTsAsComponents [] = []
|
|
|
|
|
parseDTsAsComponents l0 =
|
|
|
|
|
component : parseDTsAsComponents l4
|
|
|
|
|
where
|
|
|
|
|
(dir, l1) = takeDir l0
|
|
|
|
|
(tf , l2) = takeType l1
|
|
|
|
|
(rs , l3) = takeRanges l2
|
|
|
|
|
(tps, l4) = takeTrips l3 True
|
|
|
|
|
component = (dir, tf rs, tps)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
takeTrips :: [DeclToken] -> Bool -> ([Triplet], [DeclToken])
|
|
|
|
|
takeTrips [] True = error "incomplete declaration"
|
|
|
|
|
takeTrips [] False = ([], [])
|
|
|
|
|
takeTrips l0 force =
|
|
|
|
|
if not force && not (tripLookahead l0)
|
|
|
|
|
then ([], l0)
|
|
|
|
|
else (trip : trips, l5)
|
|
|
|
|
where
|
|
|
|
|
(x , l1) = takeIdent l0
|
|
|
|
|
(a , l2) = takeRanges l1
|
|
|
|
|
(me, l3) = takeAsgn l2
|
|
|
|
|
(_ , l4) = takeComma l3
|
|
|
|
|
trip = (x, a, me)
|
|
|
|
|
(trips, l5) = takeTrips l4 False
|
|
|
|
|
|
|
|
|
|
tripLookahead :: [DeclToken] -> Bool
|
|
|
|
|
tripLookahead [] = False
|
|
|
|
|
tripLookahead l0 =
|
|
|
|
|
-- every triplet *must* begin with an identifier
|
|
|
|
|
if not (isIdent $ head l0) then
|
|
|
|
|
False
|
|
|
|
|
-- if the identifier is the last token, or if it assigned a value, then we
|
|
|
|
|
-- know we must have a valid triplet ahead
|
|
|
|
|
else if null l1 || asgn /= Nothing then
|
|
|
|
|
True
|
|
|
|
|
-- if there is a comma after the identifier (and optional ranges and
|
|
|
|
|
-- assignment) that we're looking at, then we know this identifier is not a
|
|
|
|
|
-- type name, as type names must be followed by a first identifier before a
|
|
|
|
|
-- comma or the end of the list
|
|
|
|
|
else
|
|
|
|
|
(not $ null l3) && (head l3 == DTComma)
|
|
|
|
|
where
|
|
|
|
|
(_ , l1) = takeIdent l0
|
|
|
|
|
(_ , l2) = takeRanges l1
|
|
|
|
|
(asgn, l3) = takeAsgn l2
|
|
|
|
|
|
|
|
|
|
takeDir :: [DeclToken] -> (Direction, [DeclToken])
|
|
|
|
|
takeDir (DTDir dir : rest) = (dir , rest)
|
|
|
|
|
takeDir rest = (Local, rest)
|
|
|
|
|
|
|
|
|
|
takeType :: [DeclToken] -> ([Range] -> Type, [DeclToken])
|
|
|
|
|
takeType (DTType tf : rest) = (tf , rest)
|
|
|
|
|
takeType (DTIdent tn : rest) = (Alias tn, rest)
|
|
|
|
|
takeType rest = (Implicit, rest)
|
|
|
|
|
|
|
|
|
|
takeRanges :: [DeclToken] -> ([Range], [DeclToken])
|
|
|
|
|
takeRanges (DTRange r : rest) = (r : rs, rest')
|
|
|
|
|
where (rs, rest') = takeRanges rest
|
|
|
|
|
takeRanges rest = ([], rest)
|
|
|
|
|
|
2019-03-04 20:25:38 +01:00
|
|
|
-- TODO: entrypoints besides `parseDTsAsDeclOrAsgn` should disallow `DTAsgnNBlk`
|
|
|
|
|
-- Note: matching DTAsgnNBlk too is a bit of a hack to allow for tripLookahead
|
|
|
|
|
-- to work both for standard declarations and in `parseDTsAsDeclOrAsgn`, where
|
|
|
|
|
-- we're checking for an assignment
|
2019-03-04 08:58:00 +01:00
|
|
|
takeAsgn :: [DeclToken] -> (Maybe Expr, [DeclToken])
|
2019-03-04 20:25:38 +01:00
|
|
|
takeAsgn (DTAsgn e : rest) = (Just e , rest)
|
|
|
|
|
takeAsgn (DTAsgnNBlk e : rest) = (Just e , rest)
|
|
|
|
|
takeAsgn rest = (Nothing, rest)
|
2019-03-04 08:58:00 +01:00
|
|
|
|
|
|
|
|
takeComma :: [DeclToken] -> (Bool, [DeclToken])
|
|
|
|
|
takeComma [] = (False, [])
|
|
|
|
|
takeComma (DTComma : rest) = (True, rest)
|
|
|
|
|
takeComma _ = error "take comma encountered neither comma nor end of tokens"
|
|
|
|
|
|
|
|
|
|
takeIdent :: [DeclToken] -> (Identifier, [DeclToken])
|
|
|
|
|
takeIdent (DTIdent x : rest) = (x, rest)
|
|
|
|
|
takeIdent _ = error "takeIdent didn't find identifier"
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
isIdent :: DeclToken -> Bool
|
|
|
|
|
isIdent (DTIdent _) = True
|
|
|
|
|
isIdent _ = False
|