Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8194585
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 7, 20262026-06-07T04:52:29+00:00 2026-06-07T04:52:29+00:00

I’m trying to use Parse::RecDescent make a parser which can parse parenthetical expressions and

  • 0

I’m trying to use Parse::RecDescent make a parser which can parse parenthetical expressions and the unary operator ?.

What I have so far is failing when I create the parser because the rule expression is left-recursive:

use strict;
use warnings;
use Parse::RecDescent;

my $test = <<END;
((foo)? bar)
END

my $grammar = q(
    parse: expression(s)
    expression: string | parend | expression(s)
    parend : "(" (string | expression) ")" /\??/
    string : /\w+/ /\??/

);
my $parser = Parse::RecDescent->new($grammar);
my $result = $parser->parse($test);
if($result){
    print $result;
}else{
    print STDERR "Invalid grammar\n";
}
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-07T04:52:30+00:00Added an answer on June 7, 2026 at 4:52 am

    First, you go from lowest priority to highest priority.

    parse  : expr /\Z/
    
    expr   : list
    
    list   : unary(s?)
    
    unary  : unary '?'
           | term
    
    term   : '(' expr ')'
           | STRING
    
    STRING : /\w+/
    

    Of course,

    unary  : unary '?'
           | term
    

    doesn’t work because it’s left-recursive. Operator Associativity and Eliminating Left-Recursion in Parse::RecDescent can help you get rid of it. We get

    unary  : term unary_(s?)
    unary_ : '?'
    

    But that’s not going to construct the right tree for us. So let’s start by flattinging out the “(s?)“.

    unary  : term unary_
    unary_ : '?' unary_
           |
    

    Then we can use subrule args to create the right tree.

    unary  : term unary_[ $item[1] ]
    unary_ : '?' unary_[ [ 'postfix?' => $arg[0] ] ]
           | { $arg[0] }
    

    All together:

    use strict;
    use warnings;
    use Data::Dumper      qw( Dumper );
    use Parse::RecDescent qw( );
    
    my $grammar = <<'END';
       {
          use strict;
          use warnings;
       }
    
       parse  : expr /\Z/ { $item[1] }
    
       expr   : list
    
       list   : unary(s?) { [ $item[0] => @{ $item[1] } ] }
    
       unary  : term unary_[ $item[1] ]
       unary_ : '?' unary_[ [ 'postfix?' => $arg[0] ] ]
              | { $arg[0] }
    
       term   : '(' expr ')' { $item[2] }
              | STRING { [ string => $item[1] ] }
    
       STRING : /\w+/
    
    END
    
    my $parser = Parse::RecDescent->new($grammar)
       or die "Invalid grammar\n";
    my $tree = $parser->parse("((foo bar)? baz)\n")
       or die "Invalid text\n";
    print(Dumper($tree));
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I am trying to understand how to use SyndicationItem to display feed which is
I have a string like this: La Torre Eiffel paragonata all&#8217;Everest What PHP function
I have a French site that I want to parse, but am running into
I have this code: - (void)parser:(NSXMLParser *)parser foundCDATA:(NSData *)CDATABlock { NSString *someString = [[NSString
I have a text area in my form which accepts all possible characters from
I'm trying to use string.replace('’','') to replace the dreaded weird single-quote character: ’ (aka
I am trying to loop through a bunch of documents I have to put
I'm trying to select an H1 element which is the second-child in its group
I have a .ini file as follows: [playlist] numberofentries=2 File1=http://87.230.82.17:80 Title1=(#1 - 365/1400) Example
Basically, what I'm trying to create is a page of div tags, each has

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.