Define formal language grammar, Computer Engineering

Assignment Help:

Define formal language grammar?

A formal language grammar is a set of formation rules which describe that strings made by the alphabet of a formal language are syntactically valid, inside the language. A grammar just addresses the location as well as manipulation of the strings of the language. This does not explain anything else about a language, as its semantics.

As suggested by Noam Chomsky, a grammar G contains the following elements:

  • A finite set N of non-terminal symbols.
  • A finite set Σ of terminal symbols which is disjoint from N.
  • A finite set P of production rules, all rules of the form

Here * is the Kleene star operator and signifies set union. It is, each production rule maps by one string of symbols to the other, here the first string consists of at least one non terminal symbol.

  • An illustrious non terminal symbol from set N which is the start symbol.

Related Discussions:- Define formal language grammar

Calculate the complexity of sorting algorithms, How do you calculate the co...

How do you calculate the complexity of sorting algorithms? Find the complexity of Insertion sort and Bubble Sort.                 The difficulty of sorting algorithms depends o

Project managers complete hard problems, Why should project managers comple...

Why should project managers complete hard problems first in an OOSAD project?   Ans) The query really holds good in general for each situation in life. It is one of the prin

Explain busy tone in strowger telephony, Explain Busy tone in strowger tele...

Explain Busy tone in strowger telephony. Busy tone pattern is demonstrated in figure. This is a bursty 400 Hz signal with silence era in between. The burst and silence durati

How to add css style to your page, Q. How to add CSS style to your page? ...

Q. How to add CSS style to your page? Step 1: Click on Window Menu Step 2: Select CSS Styles Or Click on CSS Styles in the "Launcher" Step 3: Click on New to create a

Define class np, Define class NP. Problems that can be solved in polyn...

Define class NP. Problems that can be solved in polynomial time by a nondeterministic TM. Contains all problems   in P and some problems possibly outside P.

Code density and smaller faster programs, Q. Code Density and Smaller Faste...

Q. Code Density and Smaller Faster Programs? Memory was very expensive in older computer. So there was a need of less memory utilization, which is it was cost effective to have

Function wallsintact, We also need to know, given a cell, which of its neig...

We also need to know, given a cell, which of its neighbours has all of its walls intact. Write the function wallsintact that accepts the grid and a list of neighbouring cells and r

Cohesion and coupling, can i get a prepared ppt for this topic to present i...

can i get a prepared ppt for this topic to present it in a seminar??

Explain optimizing transformations, Explain optimizing transformations? ...

Explain optimizing transformations? Optimizing transformations: It is a rule for rewriting a segment of a program to enhance its execution efficiency without influencing i

Functions of header files ctype.h and string.h, What are the functions of ...

What are the functions of the following header files:  (i)  ctype.h (ii)  string.h   (i)   ctype.h: It is a header file that having character tes

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd