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

Describe buffer of receiving process, Q. Describe buffer of receiving proce...

Q. Describe buffer of receiving process? MPI_Gather (Sendaddr, Scount, Sdatatype, Receiveaddr, Rcount, Rdatatype,Rank, Comm): 'Using this function process with rank' rank

Discuss about simple mail transfer protocol briefly, Discuss about Simple M...

Discuss about Simple Mail Transfer Protocol briefly. SMTP: It is sands for Simple Mail Transfer Protocol, is a protocol for sending e-mail messages among servers. Most e-

Describe menu in dreamweaver, File Menu: Under it there are New, Save, Sav...

File Menu: Under it there are New, Save, Save as, Save as template, Import, Export, Preview in browser etc. options. Edit Menu: In this menu there are Cut, Copy, Paste, Undo,

Illustrate about probability of collision, Illustrate about probability of ...

Illustrate about probability of collision? Probability of collision: There is a triangle and on this let’s assume that there are three ants one on each corner and are free t

Explain about indexed addressing scheme, In this technique, operand field o...

In this technique, operand field of instruction includes an address and an index register thatcomprises an offset. This addressing scheme is normally used to address the consecutiv

Number system, Number systems   Consider a decimal number:         ...

Number systems   Consider a decimal number:               7654.32   Short hand for:            7 * 103 + 6*102 + 5* 101 + 4*100 + 3*10 -1  + 2*10 -2   Likewise

What is backward compatible, A program is backward compatible if it can use...

A program is backward compatible if it can use files from an older version of itself. For a file saved in the program to be backward compatible, it must be possible to open the fil

Explain the stack storage allocation model, Explain the stack storage alloc...

Explain the stack storage allocation model. In a stack-based allocation, all objects are allocated in last-in, first-out data structure and a stack. For example: Recursive subr

What is script-fu in gimp, Sript-Fu is the first GIMP scripting extension. ...

Sript-Fu is the first GIMP scripting extension. Extensions are split processes that communicate with the GIMP in the similar way that plug-ins do. The distinction is that extension

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