Scribd Logo
Upload

Welcome to Scribd!

  • D1007 CAP607 Homework

    Uploaded by

    Manish Singh
    61 views1 page
    PL / I may be extended to produce more powerful or specialized languages for specific projects. Exemplify use of pointers to maintain and process a symbol table. Give two examples of valid arithmetic expressions with corresponding parse tree s.t. Each rule is applied atleast once. Also identify recursive rules of this grammar.

    Original Description:

    Original Title

    11522_D1007 CAP607 Homework

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    PL / I may be extended to produce more powerful or specialized languages for specific projects. Exemplify use of pointers to maintain and process a symbol table. Give two examples of valid arithmetic expressions with corresponding parse tree s.t. Each rule is applied atleast once. Also identify recursive rules of this grammar.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    61 views1 page

    D1007 CAP607 Homework

    Uploaded by

    Manish Singh
    PL / I may be extended to produce more powerful or specialized languages for specific projects. Exemplify use of pointers to maintain and process a symbol table. Give two examples of valid arithmetic expressions with corresponding parse tree s.t. Each rule is applied atleast once. Also identify recursive rules of this grammar.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Homework

    CAP607: System Software


    Section: D1007 Max. Marks: 10 DoA: 31st Mar12 DoS: 11th Apr12

    Q1.Give an example of each of the following types of address constants: a) Simple relocatable b) Absolute c) Complex relocatable Q2. Chapter 5 Q. No. 3 Page No. 188 Q3. Chapter 5 Q.No.8 on Page 189 Q4. Explain when the variables are allocated and freed for each of the following storage classes: a. Static b. Controlled c. Automatic

    Q5. Fig 6.4 exemplify use of pointers to maintain and process a symbol table. Modify this example for MOT. Q6. PL/I may be extended to produce more powerful or specialized languages for specific projects. Comment on this statement giving suitable examples. Q7. For the grammar given in Q.1 of chapter 7, give two examples of valid arithmetic expressions with corresponding parse tree s.t. each rule is applied atleast once. Also give one example of invalid arithmetic expression. Also, identify recursive rules of this grammar. Q8. Why is BNF unsatisfactory for completely describing some languages? How do canonic systems overcome this deficiency? Give examples.

    You might also like