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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 15, 20262026-06-15T01:56:10+00:00 2026-06-15T01:56:10+00:00

I am writing a compiler with Yacc and having trouble figuring out how to

  • 0

I am writing a compiler with Yacc and having trouble figuring out how to write productions to match a function. In my language, functions are defined like this:

function foo(a, b, c);

I created lex patterns to match the word function to FUNC, and any C style name to NAME.

Ideally, I would want something like this:

FUNC NAME OBRACKET NAME (COMMA NAME)* CBRACKET

Which would allow some unknown number of pairs of COMMA NAME in between NAME and CBRACKET.

Additionally, how would I know how many it found?

  • 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-15T01:56:12+00:00Added an answer on June 15, 2026 at 1:56 am

    After a little experimentation, I found this to work quite well:

    int argCount;
    int args[128];
    
    arglist: nonemptyarglist
           |
            ;
    
    nonemptyarglist: nonemptyarglist COMMA singleArgList
                   | singleArgList
            {
    
            };
    
    singleArgList:
                REGISTER
            {
                args[argCount++] = $1;
            };
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I am writing a compiler for a c-like language. Currently, the compiler supports arrays
I'm writing a compiler for a simple C-like language for a course I'm taking.
According to here , the C compiler will pad out values when writing a
I'm writing a yacc file as part of a compiler. I have the following
I am writing a compiler for a subset of the Java language and during
I'm working on writing a compiler for a language running on .net and one
Possible Duplicates: implementing a compiler in “itself” Bootstrapping a language How can you write
I'm going to try to write a compiler for a dynamic language. Preferably to
I'm writing a compiler for a small language, and my Parser class is currently
I'm writing a compiler for a simple imperative language in Haskell, outputting Java bytecode.

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.