298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
|
return parseInfixOverloadSet( *FromValue< ptr< OverloadSet > >( *val ), prec );
// If the term is an infix rule value, invoke its parseInfix() function.
auto rule = FromValue< Rule >( *val );
if( !rule )
return false;
m_resolver->consume();
if( !( *rule )->isInfix() )
return false;
return ( *rule )->parseInfix( *this, t.second, prec );
}
optional< Value > Parser::popType()
{
if( !m_lastValue )
return nullopt;
|
<
<
>
>
>
>
>
>
>
>
>
|
>
>
>
>
>
|
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
|
return parseInfixOverloadSet( *FromValue< ptr< OverloadSet > >( *val ), prec );
// If the term is an infix rule value, invoke its parseInfix() function.
auto rule = FromValue< Rule >( *val );
if( !rule )
return false;
if( !( *rule )->isInfix() )
return false;
// If an infix parsing rule fails to parse, attempt to backtrack,
// so we can try to parse it again as a prefix rule if it supports it
// (case of infix operators that may act as prefix operators using a default lhs
// value in some contexts)
auto savedPosition = m_resolver->position();
auto savedLastVal = m_lastValue;
m_resolver->consume();
if( ( *rule )->parseInfix( *this, t.second, prec ) )
return true;
m_lastValue = savedLastVal;
m_resolver->setPosition( savedPosition );
return false;
}
optional< Value > Parser::popType()
{
if( !m_lastValue )
return nullopt;
|