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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 12, 20262026-05-12T00:14:24+00:00 2026-05-12T00:14:24+00:00

Using Flex and Bison, I have a grammar specification for a boolean query language,

  • 0

Using Flex and Bison, I have a grammar specification for a boolean query language, which supports logical “and”, “or”, and “not” operations, as well as nested subexpressions using “()”.

All was well until I noticed that queries like “A and B or C and D” which I’d like parsed as “(A & B) | (C & D)” was actually being interpreted as “A & ( B | ( C & D ) )”. I’m nearly certain this is an associativity issue, but can’t seem to find a proper explanation or example anywhere – that or I’m missing something important.

Pertinent information from boolpars.y:

%token TOKEN
%token OPEN_PAREN CLOSE_PAREN
%right NOT
%left AND
%left OR

%%

query:      expression                          { ... }
            ;

expression: expression AND expression           { ... }
            | expression OR expression          { ... }
            | NOT expression                    { ... }
            | OPEN_PAREN expression CLOSE_PAREN { ... }
            | TOKEN                             { ... }
            ;

Can anyone find the flaw? I can’t see why Bison isn’t giving “or” appropriate precedence.

  • 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-12T00:14:24+00:00Added an answer on May 12, 2026 at 12:14 am

    From bison docs:

    Operator precedence is determined by
    the line ordering of the declarations;
    the higher the line number of the
    declaration (lower on the page or
    screen), the higher the precedence.

    So in your case OR is lower on the screen and has higher precedence.
    Change the order to

    %left OR
    %left AND
    

    (I haven’t tested it though)

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

Sidebar

Ask A Question

Stats

  • Questions 123k
  • Answers 123k
  • Best Answers 0
  • User 1
  • Popular
  • Answers
  • Editorial Team

    How to approach applying for a job at a company ...

    • 7 Answers
  • Editorial Team

    How to handle personal stress caused by utterly incompetent and ...

    • 5 Answers
  • Editorial Team

    What is a programmer’s life like?

    • 5 Answers
  • Editorial Team
    Editorial Team added an answer The solution for ISAPI_Rewrite 3 is: RewriteEngine On RewriteBase /… May 12, 2026 at 1:08 am
  • Editorial Team
    Editorial Team added an answer You need to go to the Special:UserRights page to change… May 12, 2026 at 1:08 am
  • Editorial Team
    Editorial Team added an answer There are no direct equivalents, but they can easily be… May 12, 2026 at 1:08 am

Related Questions

I would like a utility which I can give a piece of text (in
I have several C free software/open source libraries that I develop on Linux and
I'm writing an assembler for a custom micro controller I'm working on. I've got
My day job includes working to develop a Pascal-like compiler. I've been working all
I want to create a read-eval-print loop using flex/bison parser. Trouble is, the flex

Trending Tags

analytics british company computer developers django employee employer english facebook french google interview javascript language life php programmer programs salary

Top Members

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.