Scribd Logo
Upload

Welcome to Scribd!

  • Untitled

    Uploaded by

    فارسQ م
    1 views2 pages
    This C program defines functions for parsing an expression with addition and subtraction. The main function gets the first character as lookahead and calls the expr function. Expr calls term to parse the first term and rest to parse any operators and additional terms. Rest uses lookahead to check for + or - operators and recursively calls term and itself, outputting the operator. Term checks if lookahead is a digit and if so matches and outputs it, otherwise reporting an error. Lexan gets the next character, skipping whitespace, and returns it or increments the line number for newlines.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C program defines functions for parsing an expression with addition and subtraction. The main function gets the first character as lookahead and calls the expr function. Expr calls term to parse the first term and rest to parse any operators and additional terms. Rest uses lookahead to check for + or - operators and recursively calls term and itself, outputting the operator. Term checks if lookahead is a digit and if so matches and outputs it, otherwise reporting an error. Lexan gets the next character, skipping whitespace, and returns it or increments the line number for newlines.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    1 views2 pages

    Untitled

    Uploaded by

    فارسQ م
    This C program defines functions for parsing an expression with addition and subtraction. The main function gets the first character as lookahead and calls the expr function. Expr calls term to parse the first term and rest to parse any operators and additional terms. Rest uses lookahead to check for + or - operators and recursively calls term and itself, outputting the operator. Term checks if lookahead is a digit and if so matches and outputs it, otherwise reporting an error. Lexan gets the next character, skipping whitespace, and returns it or increments the line number for newlines.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    #include<stdio.

    h>
    #include<ctype.h>
    void expr();
    void rest();
    void match(int);
    void error();
    void term();
    int lexan();
    int linenumber=0;
    int lookahed;

    int main(void){

    lookahed = getchar();
    expr();
    putchar('\n');
    }

    void error(){
    printf("Syntax error...line: %d\n",linenumber);
    }

    void expr(){
    term();
    rest();
    }

    void rest(){
    while(1){
    if(lookahed=='+'){
    match('+');
    term();
    putchar('+');
    // rest();

    }
    else if(lookahed=='-'){
    match('-');
    term();
    putchar('-');
    // rest();
    }
    else
    break;
    }
    }

    void match(int look){


    if(lookahed==look){
    lookahed=getchar();
    }
    else{
    error();
    }
    }
    void term(){
    if(isdigit(lookahed)){
    int temp = lookahed;
    match(lookahed);
    putchar(temp);
    }
    else{
    error();
    }

    }
    int lexan(){
    int toxen;
    while(1){
    toxen=getchar();
    if(toxen==' '||toxen=='\t'){

    }
    else if(toxen=='\n')
    linenumber++;
    else
    return toxen;

    }
    }

    You might also like