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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 27, 20262026-05-27T07:38:28+00:00 2026-05-27T07:38:28+00:00

Say I have a grammar like this: expr : expr ‘+’ expr { $$

  • 0

Say I have a grammar like this:

expr : expr '+' expr   { $$ = operation('+', $1, $3); }
     | expr '-' expr   { $$ = operation('-', $1, $3); }
     | expr '*' expr   { $$ = operation('*', $1, $3); }
     | expr '/' expr   { $$ = operation('/', $1, $3); }
     | num
     ;

Where each of those operators has a precedence attached and is marked as left associative.

Then I want to refactor my grammar such that:

op   : '+' | '-' | '*' | '/' ;

expr : expr op expr { $$ = operation($2, $1, $3); }
     | num
     ;

How does yacc (if even at all) determine the associativity and precedence of op in this case? Will it trace its way through all the possible precedences/associativities of +, -, * and / when evaluating op, or does defining an associativity for nonterminal symbols make no sense?

AFAIK, with precedence order for nonterminals, it uses the precedence of the rightmost terminal symbol, but I can’t find any documentation on the associativity rules themselves for nonterminals.

  • 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-27T07:38:29+00:00Added an answer on May 27, 2026 at 7:38 am

    The “normal” way to do this (as far as I’m aware) is to define a different expr type for each operator, that way you get very explicit control over what’s happening.

    Python’s grammar is a good example of this: http://docs.python.org/reference/grammar.html.

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

Sidebar

Related Questions

Say I have a Boost Spirit grammar like this, where a parent rule passes
Let's say I have a grammar defined to something like: some_rule := a b
let say have element like this <div class=watch-me style=display: none;>Watch Me Please</div> as we
Let's say I have a grammar file with this code. // START:members @header {
Say have normal class in iOS, called A. I'd like to pass this as
Lets say have this immutable record type: public class Record { public Record(int x,
Let's say have something like: SELECT energy_produced, energy_consumed, timestamp1 AS timestamp FROM ( SELECT
Say I have an ASMX web service, MyService. The service has a method, MyMethod.
Say I have a class named Frog, it looks like: public class Frog {
Say I have a piece of ANTLR grammar (lexer part) fragment LETTER : ('a'..'z'

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.