Given the following expression in language A(true op1 (false op2 true))Which of the following expressions in Language B has the same semantic meaning? (Assuming thatoperations occur left to right like the OpSem, I.E. e₁ op1 e2 is not the same as e2 op1 e1)op3 op4 true false trueop3 op4 false true trueop3 true op4 false trueop3 false op4 true trueNone of the above Recall that Operational Semantics gives meaning to expressions by the operations performed.Consider the two operational semantic rules for two languages A and B. OCaml will be the meta-language for both.Language AA; true trueA; falsefalseA; e1 ⇒v1A; e2 ⇒ V2A; (e1 opl e2)V3 =if v₁ then V2 else V1v3A; e1⇒v1A; e2 ⇒ V2 v3if v₁ then v₁ else v₂A; (e1 op2 e2)v3Language BA; true trueA; false=> falseA; e1 ⇒v1A; e2 ⇒ V2V3 = v₁ && v₂A; op3 e₁ e2V3A; e1 ⇒v1A; e2 ⇒ V2v3 = v1 || v2A; op4 e₁ e2 ⇒ V3

Answered: Given the following expression in…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

9. Give a context-free grammar for a context-free language. Let L be the language of all algebraic expres- sions where The operations are addition, subtraction and multiplication, there are parentheses, and the only variables are x, y, and z. Give an unambiguous CF grammar for L, where addition and subtrac- tion have equal precedence, multiplication has precedence over addition and subtraction, and all three operations are left associative.
Part A. Review the concepts by yourself: (1) Describe the difference between a regular grammar and a context-free grammar from their definitions focusing on the forms of productions. (2) Explain the definitions and relations among the language, grammar, and automata for context- free language. (3) Given a context-free grammar, why we need to remove the productions in form of A -> B or A - >1. to get an equivalent one? (4) Given a context-free grammar G, what is the relation L(G) and derivation tree? (5) What is the relation between Turing machine and our current computer? (6) What are the output of DFA/NFA, Pushdown Machine, and Turing Machine?
Q 2. Give a CFG G that generates all regular expressions on the alphabet Σ = {a,b}. i) Provide the full formal definition of the grammar. Clearly specify the alphabet of your CFG, its terminals, variables, and productions. ii) What is L(G)? Is it regular? It is context-free? Why?
(b) Consider the following context-free grammar, partially augmented with semantic rules: {NP.sem(VP.sem)} + Det Nominal {Det.sem(Nominal.sem)} Nominal → Adj Nominal {Adj.sem(Nominal.sem)} {..} { ...} { ...} S → NP VP NP Det + every Det a → small Nominal → dog → barks Adj VP {...} Now consider the following two sentences, with their desired meaning represen- tations: A1 every dog barks A2 Vd Dog (d) =→ Je Barking (e) A Barker(e, d) B1 a small dog barks B2 3d Dog(d) A Small(d) ^ Je Barking(e) A Barker(e, d) Complete the above augmented grammar, by giving the semantics of 'every', 'a', 'small', 'dog', and barks', so that the desired meaning representations are obtained for A1 and B1. Show that your solution is correct, by first giving the lambda expressions obtained from A1 and B1 before any beta reductions, and then showing step-by-step that the beta reductions lead to A2 and B2.
1. Consider the following grammar and try to find out Operator Precedence and Associativity. Is the grammar Ambiguous? If so, find a string for which it is ambiguous and finally, convert to Unambiguous grammar without changing the original Language. S → S % A/ A A → B * A/ B В — В & C/С C → S/ id
1. Consider the following grammar and try to find out Operator Precedence and Associativity. Is the grammar Ambiguous? If so, find a string for which it is ambiguous and finally, convert to Unambiguous grammar without changing the original Language. S-S% A/ A A-B* A/ B B - B & C/ C C- S/ id
4. Write a regular expression (RE) to define the language of all strings that start with 'bb' and contain the substring 'aa' and finish with 'a'. 5. Give a Push Down Automaton (PDA) to decide the language { arban+1 /n>=0} 6. Give a Context Free Grammar (CFG) to define the language { arb2n+1 /n>=0} 7. Give a Turing machine to decide the language: {w in {a,b}* / w starts with "aa" and ends with "ba"}
1.Eliminate left recursion from the production rules that are given in below. E = E + T / T 2.Define context-free grammar. 3.Write down the characteristic of context-free grammar.
Backus Naur Form (BNF) is a standard notation for expressing syntax as a set of grammar rules. Figure 1 below shows a grammar for assignment with arithmetic operations, e.g. y = (2*x + 5)*x - 7; assignment => ID = expression ; expression => expression + term I expression - term I term term term * factor | term / factor | factor ( expression ) | ID | NUMBER factor => Figure 1. Grammar (a) Identify and list all the non-terminal symbols in the grammar (b) Identify and list all the terminal symbols in the grammar
Assume that G is a Context Free Grammar as the 4-tuple (V,T,S,P) where V={S,A,B} set of non-terminal symbols, T={ab} set of terminal symbols, and S is the start symbol, and P is the set of the production rules. Select the correct statement(s). P is defined as {X→Y: such that XEV, YE(VUT)* } P is defined as {X→Y: such that XEV, YE(VUT)* } ☐ {S→ε} can not be a subset of P. ]{S→Aa|AB|bA} can be a subset of P.
subject theory of automata
4. Given the language L = {wxwR: w ∈ {a, b}*, x is a fixed terminal symbol}, answer the following questions: a) Write the context-free grammar that generates L b) Construct the pda that accepts L from the grammar of (a) c) Construct the pda that accepts L directly based on the similar skill used in wwR. d) Is this language a deterministic context-free language?

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS