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

  • Home
  • SEARCH
  • 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 7832245
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 2, 20262026-06-02T12:06:59+00:00 2026-06-02T12:06:59+00:00

Say I have this C program. #include <stdio.h> int main(void) { int monday =

  • 0

Say I have this C program.

#include <stdio.h>

int main(void)
{
  int monday = 1;
  int tuesday = 2;

  if(monday == tuesday) { fprintf("I should quit my day job"); }

  return 1;
}

What would the tokens be?

What does bison provide me, as a programmer? Certianly, bison does not generate machine code with just a parser grammar? So how do I interface with bison? I am not expecting a full answer here, just a pointer to good websites and books.

  • 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-02T12:07:02+00:00Added an answer on June 2, 2026 at 12:07 pm

    Bison implements a generalized LR parser. See http://www.gnu.org/software/bison/manual/bison.html for fairly extensive documentation, with examples. You don’t get back a parse tree per se; instead, you write “actions” that activate on each reduction. Of course, if your actions simply build a parse tree, that will do the trick, if you want to obtain a parse tree. Modern bison also has a lot of extra tweaking you can insert.

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

Sidebar

Related Questions

Say I have the following program #include <stdio.h> #include <stdlib.h> int main(void) { int
Say I have the following c program: #include <stdio.h> int main() { printf(Hello world
I have this code below #include <stdio.h> int main(){ int i=0; for(i=0; i<1000; i++)
Let us say i have File1.c: #include<stdio.h> #includeFile2.c void test(void) { sum(1,2); } int
So basically: #include <stdio.h> #include <conio.h> #include <stdlib.h> #include <string.h> int main(void){ //test strrev
Lets say I have hierarchy like this (This is just a test program. Please
Lets say have this immutable record type: public class Record { public Record(int x,
Say I have this class: class myclass { public int Field1{ get; set; }
Say I have this class: public class Account { public int AccountID { get;
Okay so my question is this. Say I have a simple C++ code: #include

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.