Find out the closure of attribute set (AG), i.e., (AG)+ in R. Set of FD’s are as given: R= {A,B,C,G,H,I}, F= {A → B,A → C,CG → H,B → H}. Is (AG) a super key of R?

A→B, B→H, so A→H (Transitivity)

Demo Teacher

added 2 years ago

Write the difference between procedural and non-procedural query language.

A query language is a language in which a user requests information from the database.

Demo Teacher

added 2 years ago

Write the rules of DBA.

Database administration (DBA) is an operational or technical level function responsible for physical database design, security enforcement, and database performance.

Demo Teacher

added 2 years ago

Eliminate left recursion from the following grammar:

Demo Teacher

added 2 years ago

For the input expression (4*7+1)*2, construct an annotated parse tree.

Annotated parse tree

Demo Teacher

added 2 years ago

Consider the grammar:

S → aSbS | bSaS | 𝜖

• Show that this grammar is ambiguous by constructing two different left most derivations for the sentence abab.

• Construct the corresponding right most derivations for abab.

• Construct the corresponding parse tree for abab.

• What language does this grammar generate?

Case 1: S→aSbS

Demo Teacher

added 2 years ago

Show that no left recursive grammar can be LL(1). Show that no LL(1) grammar can be ambiguous.

First of all FIRST and FOLLOW over the grammar must find out in which left recursion has been removed.

Demo Teacher

added 2 years ago

What do you understand by L-attributed definition? Give example. Describe with diagram the working process of Lexical Analyzer. Describe LR parsing with block diagram.

L-attributes: All variables have an attribute associated with it, getting some values.

Demo Teacher

added 2 years ago

Write short notes on:

• LEX

• YACC

Lex is a program generator designed for lexical processing of character input streams. It accepts a high-level, problem oriented specification for character string matching, and produces a program in a general purpose language which recognizes regular expressions.

Demo Teacher

added 2 years ago

Write short notes on: 

• Peephole Optimization

• Symbol Table

• Cross Compiler

In compiler optimization theory, the compiler optimization basically refers to the program optimization to achieve performance in the execution.

Demo Teacher

added 2 years ago