use crate::*; // ----------------------------------------------------------------------------- #[tracable_parser] #[packrat_parser] pub(crate) fn case_statement(s: Span) -> IResult { alt(( case_statement_normal, case_statement_matches, case_statement_inside, ))(s) } #[tracable_parser] #[packrat_parser] pub(crate) fn case_statement_normal(s: Span) -> IResult { let (s, a) = opt(unique_priority)(s)?; let (s, b) = case_keyword(s)?; let (s, c) = paren(case_expression)(s)?; let (s, d) = case_item(s)?; let (s, e) = many0(case_item)(s)?; let (s, f) = keyword("endcase")(s)?; Ok(( s, CaseStatement::Normal(Box::new(CaseStatementNormal { nodes: (a, b, c, d, e, f), })), )) } #[tracable_parser] #[packrat_parser] pub(crate) fn case_statement_matches(s: Span) -> IResult { let (s, a) = opt(unique_priority)(s)?; let (s, b) = case_keyword(s)?; let (s, c) = paren(case_expression)(s)?; let (s, d) = keyword("matches")(s)?; let (s, e) = case_pattern_item(s)?; let (s, f) = many0(case_pattern_item)(s)?; let (s, g) = keyword("endcase")(s)?; Ok(( s, CaseStatement::Matches(Box::new(CaseStatementMatches { nodes: (a, b, c, d, e, f, g), })), )) } #[tracable_parser] #[packrat_parser] pub(crate) fn case_statement_inside(s: Span) -> IResult { let (s, a) = opt(unique_priority)(s)?; let (s, b) = keyword("case")(s)?; let (s, c) = paren(case_expression)(s)?; let (s, d) = keyword("inside")(s)?; let (s, e) = case_inside_item(s)?; let (s, f) = many0(case_inside_item)(s)?; let (s, g) = keyword("endcase")(s)?; Ok(( s, CaseStatement::Inside(Box::new(CaseStatementInside { nodes: (a, b, c, d, e, f, g), })), )) } #[tracable_parser] #[packrat_parser] pub(crate) fn case_keyword(s: Span) -> IResult { alt(( map(keyword("casez"), |x| CaseKeyword::Casez(Box::new(x))), map(keyword("casex"), |x| CaseKeyword::Casex(Box::new(x))), map(keyword("case"), |x| CaseKeyword::Case(Box::new(x))), ))(s) } #[tracable_parser] #[packrat_parser] pub(crate) fn case_expression(s: Span) -> IResult { let (s, a) = expression(s)?; Ok((s, CaseExpression { nodes: (a,) })) } #[tracable_parser] #[packrat_parser] pub(crate) fn case_item(s: Span) -> IResult { alt(( case_item_nondefault, map(case_item_default, |x| CaseItem::Default(Box::new(x))), ))(s) } #[recursive_parser] #[tracable_parser] #[packrat_parser] pub(crate) fn case_item_nondefault(s: Span) -> IResult { let (s, a) = list(symbol(","), case_item_expression)(s)?; let (s, b) = symbol(":")(s)?; let (s, c) = statement_or_null(s)?; Ok(( s, CaseItem::NonDefault(Box::new(CaseItemNondefault { nodes: (a, b, c) })), )) } #[tracable_parser] #[packrat_parser] pub(crate) fn case_item_default(s: Span) -> IResult { let (s, a) = keyword("default")(s)?; let (s, b) = opt(symbol(":"))(s)?; let (s, c) = statement_or_null(s)?; Ok((s, CaseItemDefault { nodes: (a, b, c) })) } #[tracable_parser] #[packrat_parser] pub(crate) fn case_pattern_item(s: Span) -> IResult { alt(( case_pattern_item_nondefault, map(case_item_default, |x| CasePatternItem::Default(Box::new(x))), ))(s) } #[recursive_parser] #[tracable_parser] #[packrat_parser] pub(crate) fn case_pattern_item_nondefault(s: Span) -> IResult { let (s, a) = pattern(s)?; let (s, b) = opt(pair(symbol("&&&"), expression))(s)?; let (s, c) = symbol(":")(s)?; let (s, d) = statement_or_null(s)?; Ok(( s, CasePatternItem::NonDefault(Box::new(CasePatternItemNondefault { nodes: (a, b, c, d), })), )) } #[tracable_parser] #[packrat_parser] pub(crate) fn case_inside_item(s: Span) -> IResult { alt(( case_inside_item_nondefault, map(case_item_default, |x| CaseInsideItem::Default(Box::new(x))), ))(s) } #[recursive_parser] #[tracable_parser] #[packrat_parser] pub(crate) fn case_inside_item_nondefault(s: Span) -> IResult { let (s, a) = open_range_list(s)?; let (s, b) = symbol(":")(s)?; let (s, c) = statement_or_null(s)?; Ok(( s, CaseInsideItem::NonDefault(Box::new(CaseInsideItemNondefault { nodes: (a, b, c) })), )) } #[tracable_parser] #[packrat_parser] pub(crate) fn case_item_expression(s: Span) -> IResult { let (s, a) = expression(s)?; Ok((s, CaseItemExpression { nodes: (a,) })) } #[tracable_parser] #[packrat_parser] pub(crate) fn randcase_statement(s: Span) -> IResult { let (s, a) = keyword("randcase")(s)?; let (s, b) = randcase_item(s)?; let (s, c) = many0(randcase_item)(s)?; let (s, d) = keyword("endcase")(s)?; Ok(( s, RandcaseStatement { nodes: (a, b, c, d), }, )) } #[recursive_parser] #[tracable_parser] #[packrat_parser] pub(crate) fn randcase_item(s: Span) -> IResult { let (s, a) = expression(s)?; let (s, b) = symbol(":")(s)?; let (s, c) = statement_or_null(s)?; Ok((s, RandcaseItem { nodes: (a, b, c) })) } #[recursive_parser] #[tracable_parser] #[packrat_parser] pub(crate) fn open_range_list(s: Span) -> IResult { let (s, a) = list(symbol(","), open_value_range)(s)?; Ok((s, OpenRangeList { nodes: (a,) })) } #[tracable_parser] #[packrat_parser] pub(crate) fn open_value_range(s: Span) -> IResult { let (s, a) = value_range(s)?; Ok((s, OpenValueRange { nodes: (a,) })) }