Scribd Logo
Upload

Welcome to Scribd!

  • 28 views

    Recursive Descent Parser

    Uploaded by

    axar kumar
    This C++ program performs recursive descent parsing of arithmetic expressions based on a context-free grammar. It takes an expression as input, calls the E parsing function, and checks if the entire expression was parsed, printing "Accepted" if so and "Rejected" otherwise. The E, T, E', T', and F functions recursively parse expressions, terms, and factors according to the grammar rules, outputting each step.

    Copyright:

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

    Recursive Descent Parser

    Uploaded by

    axar kumar
    28 views2 pages
    This C++ program performs recursive descent parsing of arithmetic expressions based on a context-free grammar. It takes an expression as input, calls the E parsing function, and checks if the entire expression was parsed, printing "Accepted" if so and "Rejected" otherwise. The E, T, E', T', and F functions recursively parse expressions, terms, and factors according to the grammar rules, outputting each step.

    Original Description:

    Original Title

    7. Recursive Descent Parser

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C++ program performs recursive descent parsing of arithmetic expressions based on a context-free grammar. It takes an expression as input, calls the E parsing function, and checks if the entire expression was parsed, printing "Accepted" if so and "Rejected" otherwise. The E, T, E', T', and F functions recursively parse expressions, terms, and factors according to the grammar rules, outputting each step.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    28 views2 pages

    Recursive Descent Parser

    Uploaded by

    axar kumar
    This C++ program performs recursive descent parsing of arithmetic expressions based on a context-free grammar. It takes an expression as input, calls the E parsing function, and checks if the entire expression was parsed, printing "Accepted" if so and "Rejected" otherwise. The E, T, E', T', and F functions recursively parse expressions, terms, and factors according to the grammar rules, outputting each step.

    Copyright:

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

    #include <iostream>

    #include <stdlib.h>
    using namespace std;
    int count = 0;
    void E();
    void Ed();
    void T();
    void Td();
    void F();

    string expr;
    int main() {
    cout<<"Recursive Descent Parsing of the following grammar:";
    cout<<"\n E->TE' \n E'->+TE'|@ \n T-> FT' \n T'->*FT'|@ \n F->(E)|id \n";
    cout<<"Enter an arithmetic expression: ";

    cin >> expr;


    int l = expr.length();
    expr += "$";
    E();
    if (l == count)
    cout << "Accepted" << endl;
    else
    cout << "Rejected" << endl;
    }

    void E() {
    cout << "E->TE'" << endl;
    T();
    Ed();
    }

    void Ed() {
    if (expr[count] == '+') {
    count++;
    cout << "E'->+TE'" << endl;
    T();
    Ed();
    }

    else if (expr[count] == '-') {


    count++;
    cout << "E'->-TE'" << endl;
    T();
    Ed();
    }

    else {
    cout << "E'->null" << endl;
    }
    }

    void T() {
    cout << "T->FT'" << endl;
    F();
    Td();
    }

    void Td() {
    if (expr[count] == '*') {
    count++;
    cout << "T'->*FT'" << endl;
    F();
    Td();
    }

    else if (expr[count] == '/') {


    count++;
    cout << "T'->/FT'" << endl;
    F();
    Td();
    }

    else {
    cout << "T'->null" << endl;
    }
    }

    void F() {
    if (isalpha(expr[count])) {
    count++;
    cout << "F->id" << endl;
    } else if (isdigit(expr[count])) {
    count++;
    cout << "F->digit" << endl;
    } else if (expr[count] == '(') {
    count++;
    cout << "F->(E)" << endl;
    E();
    if (expr[count] != ')') {
    cout << "Rejected" << endl;
    exit(0);
    }
    count++;
    } else {
    cout << "Rejected" << endl;
    exit(0);
    }
    }

    You might also like