1. [15] Consider the following grammar. Again all the nonterminals are all surrounded byangle brackets ((...)) and everything else is a terminal.a | (aseq) a(bseq) b| (cseq) c(aseq)(bseq)=(cseq)a(string) ::=(aseq) (bseq) (cseq)(hstring) :=(num) H (string)Assume that (num) is defined using an attribute grammar that defines an integer and asso-ciates with (num) an attribute val representing its numerical value.(a) [10] Add semantic actions and appropriate attributes to the grammar to (a) computethe length of a string generated by (string), and (b) ensure that an (hstring) is valid ifand only if the number preceding H is equal to the length of the string following H.(b) [5] For each attribute used in the previous question state its type (synthesized or inher-ited) and explain why this is so.

(a) Semantic Actions and Attributes ToCalculate the length of string produced by grammar for…

Answered: 1. [15] Consider the following grammar.…

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

1. Use the algorithm described in class that takes a CFG and converts it into a CNF (Chomsky Normal Form) grammar that generates the same language as the original grammar, except possibly for the string A, to answer the following question. As part of your answer, you should say which variables are nullable, and you should give the appropriate grammar after each step of the algorithm. There are four steps. Give a CFG (context-free grammar) in CNF (Chomsky Normal Form) that generates the same language, except possibly for the string A, as the following grammar: SAB AB →bAa A → aaB bb
"Introduction to Formal Languages and Automaton" by Peter Linz, 6th edition, 2017. The cut is from chapter 1, section 2, e 14.
"Introduction to Formal Languages and Automaton" by Peter Linz, 6th edition, 2017. The cut is from chapter 1, section 2, e 17, d, e, f.
I want a solution from a professor in software engineering
This is a practice question from my Discrete Mathematical Structures course. Thank you.
Problem 1: Write a regular expression that recognizes the following language over the alphabet {a,b}: Any string containing the letters a and b, where the number of letters is not a multiple of three. (Note that 0 is a multiple of three.) Your regular expression should contain only a and b, and the metacharacters (, ), *, +, ? and |. Problem 2: Write a context free grammar that recognizes language from Problem 1. Your start symbol should be named S.
.
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?
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.
Answer the given question with a proper explanation and step-by-step solution.
Computer Science Consider the context free grammar (CFG):S -> AB (S being the start symbol)A ->aAb | aabbB -> cBd | cdThe grammar is strong LL(k).a) Determine the value of k.b) As a result of a) above, compute the corresponding look ahead sets (for eachproduction).c) As a result of b) above, write (in C++ pseudo code) the corresponding recursivedescent parser (for the grammar)..
Let's consider a grammar for expressions is defined as follows.<assign> -> <id> = <expr><id> -> A | B | C | D<expr> -> <id> + <expr> | <id> * <expr> | ( <expr> ) | <id>1. Is this grammar unambiguous? Can you explain in detail?2. How can I design a PDA (PushDown Automata) M that recognizes the BNF (i.e. a metasyntax notation for CFG)?

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