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 7572789
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 30, 20262026-05-30T16:00:53+00:00 2026-05-30T16:00:53+00:00

I am doing an ANTLR specification. In my AST i need to do this

  • 0

I am doing an ANTLR specification. In my AST i need to do this one:

characters ('*'^|'+'^|'?'^)?

I need to do a rewrite rule that will present in ast instead of * ASTERISK, instead of + PLUS and instead of ? QMARK nodes?

I know that if we would have something like this:

characters '*' 

it can be rewrited as

^(ASTERISK characters)

but i dont know how to deal with | operator?

  • 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-05-30T16:00:55+00:00Added an answer on May 30, 2026 at 4:00 pm

    Try this:

    grammar T;
    
    // options ...
    
    tokens {
      ASTERISK;
      PLUS;
      QMARK;
    }
    
    // @header and/or @members ...
    
    rule
     : (characters -> characters) ( '*' -> ^(ASTERISK characters)
                                  | '+' -> ^(PLUS characters)
                                  | '?' -> ^(QMARK characters)
                                  )?
     ;
    

    The key here is that if the optional *, + or ? are not present, the characters will just stay characters by the rewrite rule: (characters -> characters).

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

When doing TDD , how to tell that's enough tests for this class /
I have a tree parser that's doing semantic analysis on the AST generated by
Is this possible? Given that C# uses immutable strings, one could expect that there
Doing a little search i realized that to make an equalizer. I need to
Doing an alert() on one of my variables gives me this result [object NodeList]
Im doing something like this to get a list of all users that have
Doing the below will reproduce my problem: New WPF Project Add ListView Name the
Doing something like this: from zipfile import ZipFile #open zip file zipfile = ZipFile('Photo.zip')
doing this in AppDelegate: viewController = [[RootViewController alloc] initWithNibName:nil bundle:nil]; Is there any problem
How to create a parser rule that accept whatever the previous rules doesn't accept?

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.