Scribd Logo
Upload

Welcome to Scribd!

  • 163 views

    Experiment 10:: AIM: WAP To Implement Shift Reduce Parser

    Uploaded by

    akshat sharma
    This document describes an experiment to implement a shift-reduce parser. It provides the aim, theory, code, and output sections. The theory section explains that a shift-reduce parser constructs a parse tree from bottom to top using two operations: shift, which moves symbols from the input onto a stack, and reduce, which replaces symbols on the stack based on production rules. The code section implements this parser on sample grammar rules with an input string, stack, and actions printed out at each step.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Experiment 10:: AIM: WAP To Implement Shift Reduce Parser

    Uploaded by

    akshat sharma
    163 views5 pages
    This document describes an experiment to implement a shift-reduce parser. It provides the aim, theory, code, and output sections. The theory section explains that a shift-reduce parser constructs a parse tree from bottom to top using two operations: shift, which moves symbols from the input onto a stack, and reduce, which replaces symbols on the stack based on production rules. The code section implements this parser on sample grammar rules with an input string, stack, and actions printed out at each step.

    Original Title

    Lab 10 CC

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document describes an experiment to implement a shift-reduce parser. It provides the aim, theory, code, and output sections. The theory section explains that a shift-reduce parser constructs a parse tree from bottom to top using two operations: shift, which moves symbols from the input onto a stack, and reduce, which replaces symbols on the stack based on production rules. The code section implements this parser on sample grammar rules with an input string, stack, and actions printed out at each step.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    163 views5 pages

    Experiment 10:: AIM: WAP To Implement Shift Reduce Parser

    Uploaded by

    akshat sharma
    This document describes an experiment to implement a shift-reduce parser. It provides the aim, theory, code, and output sections. The theory section explains that a shift-reduce parser constructs a parse tree from bottom to top using two operations: shift, which moves symbols from the input onto a stack, and reduce, which replaces symbols on the stack based on production rules. The code section implements this parser on sample grammar rules with an input string, stack, and actions printed out at each step.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 5

    EXPERIMENT 10:

    AIM: WAP to implement Shift Reduce Parser.

    THEORY:-

    Shift Reduce parser attempts for the construction of parse in a similar manner as done in
    bottom-up parsing i.e. the parse tree is constructed from leaves(bottom) to the root(up). A more
    general form of the shift-reduce parser is the LR parser.
    This parser requires some data structures i.e.
     An input buffer for storing the input string.
     A stack for storing and accessing the production rules.
    Basic Operations –
     Shift: This involves moving symbols from the input buffer onto the stack.
     Reduce: If the handle appears on top of the stack then, its reduction by using appropriate
    production rule is done i.e. RHS of a production rule is popped out of a stack and LHS of
    a production rule is pushed onto the stack.
     Accept: If only the start symbol is present in the stack and the input buffer is empty then,
    the parsing action is called accept. When accepted action is obtained, it is means
    successful parsing is done.
     Error: This is the situation in which the parser can neither perform shift action nor
    reduce action and not even accept action.

    CODE:

    #include<stdio.h>
    #include<string.h>
    int k=0,z=0,i=0,j=0,c=0;
    char a[16],ac[20],stk[15],act[10];
    void check();
    int main()
    { puts("GRAMMAR is E->E+E \n E->E*E \n E->(E) \n E->id");
    puts("enter input string ");
    gets(a);
    c=strlen(a);
    strcpy(act,"SHIFT->");
    puts("stack \t input \t action");
    for(k=0,i=0; j<c; k++,i++,j++)
    {
    if(a[j]=='i' && a[j+1]=='d')
    {
    stk[i]=a[j];
    stk[i+1]=a[j+1];
    stk[i+2]='\0';
    a[j]=' ';
    a[j+1]=' ';
    printf("\n$%s\t%s$\t%sid",stk,a,act);
    check();
    }
    else
    {
    stk[i]=a[j];
    stk[i+1]='\0';
    a[j]=' ';
    printf("\n$%s\t%s$\t%ssymbols",stk,a,act);
    check();
    }}}
    void check()
    {
    strcpy(ac,"REDUCE TO E");
    for(z=0; z<c; z++)
    if(stk[z]=='i' && stk[z+1]=='d')
    {
    stk[z]='E';
    stk[z+1]='\0';
    printf("\n$%s\t%s$\t%s",stk,a,ac);
    j++;
    }
    for(z=0; z<c; z++)
    if(stk[z]=='E' && stk[z+1]=='+' && stk[z+2]=='E')
    {
    stk[z]='E';
    stk[z+1]='\0';
    stk[z+2]='\0';
    printf("\n$%s\t%s$\t%s",stk,a,ac);
    i=i-2;
    }
    for(z=0; z<c; z++)
    if(stk[z]=='E' && stk[z+1]=='*' && stk[z+2]=='E')
    {
    stk[z]='E';
    stk[z+1]='\0';
    stk[z+1]='\0';
    printf("\n$%s\t%s$\t%s",stk,a,ac);
    i=i-2;
    }
    for(z=0; z<c; z++)
    if(stk[z]=='(' && stk[z+1]=='E' && stk[z+2]==')')
    {
    stk[z]='E';
    stk[z+1]='\0';
    stk[z+1]='\0';
    printf("\n$%s\t%s$\t%s",stk,a,ac);
    i=i-2;
    }
    }

    OUTPUT;

    RESULT:
    The program is successfully written and created in the c language

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy