Scribd Logo
Upload

Welcome to Scribd!

  • 4K views

    Write A Program Parse Using Brute Force Technique of Top Down Parsing

    Uploaded by

    it2020
    This program uses a brute force top-down parsing technique to parse a tree structure represented by an array. It takes user input to populate the array with node values, starting from the root node. It then traverses the array from bottom to top to calculate the minimum path sum, outputting the result.

    Copyright:

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

    Write A Program Parse Using Brute Force Technique of Top Down Parsing

    Uploaded by

    it2020
    4K views2 pages
    This program uses a brute force top-down parsing technique to parse a tree structure represented by an array. It takes user input to populate the array with node values, starting from the root node. It then traverses the array from bottom to top to calculate the minimum path sum, outputting the result.

    Original Description:

    program parse using brute force technique of top down parsing

    Original Title

    Write a Program Parse Using Brute Force Technique of Top Down Parsing

    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 program uses a brute force top-down parsing technique to parse a tree structure represented by an array. It takes user input to populate the array with node values, starting from the root node. It then traverses the array from bottom to top to calculate the minimum path sum, outputting the result.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    4K views2 pages

    Write A Program Parse Using Brute Force Technique of Top Down Parsing

    Uploaded by

    it2020
    This program uses a brute force top-down parsing technique to parse a tree structure represented by an array. It takes user input to populate the array with node values, starting from the root node. It then traverses the array from bottom to top to calculate the minimum path sum, outputting the result.

    Copyright:

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

    Write a program parse using brute force technique of top down parsing?

    #include<stdio.h>
    #include<conio.h>
    #include<iostream.h>
    void main()
    {
    int a[30];
    clrscr();
    int min=10000,temp=0,i,lev,n,noofc,z;
    printf("please enter how many number");
    cin>>n;
    for(i=0;i<n;i++)
    a[i]=0;
    cout<<"enter value of root";
    cin>>a[0];
    for(i=1;i<=n/2;i++)
    {
    cout<<"please enter no of child of parent with value"<<a[i-1]<<":";
    cin>>noofc;
    for(int j=1;j<=noofc;j++)
    {z=(i)*2+j-2;
    cout<<"please enter value of child";
    cin>>a[z];
    }
    }
    for(i=n-1;i>=n/2;i--)
    {
    temp=0;
    for(int j=i+1;j>=1;j=j/2)
    temp=temp+a[j-1];
    if(temp<min)
    min=temp;
    cout<<"temp min is"<<temp<<"\n";
    }
    cout<<"min is"<<min;
    getch();
    }

    You might also like