pub fn parse_paren_expr<P: Parser>(p: &mut P) -> ReportedResult<ast::ParenElems> {
    let mut span = p.peek(0).span;
    let v = flanked(p, Paren, parse_paren_elem_vec)?;
    span.expand(p.last_span());
    Ok(Spanned::new(v, span))
}
/// Try to parse a parenthesized expression. This is a combination of a variety
/// of rules from the VHDL grammar. Most notably, it combines the following:
///
/// - `aggregate`
/// - `association_list`
/// - suffix of `slice_name`
/// - suffix of `indexed_name`
/// - suffix of `function_call`
///
/// ```text
/// paren_expr := "(" { [ { expr }"|"+ "=>" ] expr }","+ ")"
/// ```
Try to parse a parenthesized expression. This is a combination of a variety
of rules from the VHDL grammar. Most notably, it combines the following.




Try to parse a parenthesized expression . This is a combination of a variety of rules from the VHDL grammar . Most notably it combines the following .
pub fn parse_paren_expr<P: Parser>(p: &mut P) -> ReportedResult<ast::ParenElems> {
    let mut span = p.peek(0).span;
    let v = flanked(p, Paren, parse_paren_elem_vec)?;
    span.expand(p.last_span());
    Ok(Spanned::new(v, span))
}
pub fn parse_paren_expr < P : Parser > ( p : & mut P ) -> ReportedResult < ast :: ParenElems > { let mut span = p . peek ( 0 ) . span ; let v = flanked ( p , Paren , parse_paren_elem_vec ) ? ; span . expand ( p . last_span ( ) ) ; Ok ( Spanned :: new ( v , span ) ) }
Try to parse a parenthesized expression.
Try to parse a parenthesized expression .
p
&mut P
p
&mut P