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

Differences between datagrid and datalist, Differences between Datagrid, Da...

Differences between Datagrid, Datalist and Repeater?   1. Datagrid has paging while Datalist doesnt. 2. Datalist has a property known as repeat. Direction = vertical/horizon

Define secondary memory, Define secondary memory. This memory holds tho...

Define secondary memory. This memory holds those pages that are not present in main memory. The secondary memory is usually a high speed disk. It is known as the swap evice, an

External communication interfaces, External interface is interface between ...

External interface is interface between I/O interface and peripheral devices. Interface can be characterised into 2 main categories: (a) parallel interface and (b) serial interface

What is reduction, What is reduction?  A reduction is a way of changing...

What is reduction?  A reduction is a way of changing one problem into another in such a way that a solution to the second problem can be used to explain the first problem.

Perfect induction, Any identity or equality in Boolean algebra, suchas de M...

Any identity or equality in Boolean algebra, suchas de Morgan's Theorem can be proved usingthe method of perfect induction. 1. All combinations of variables are written down.

Explain the multiple bus organization structure, Explain the multiple bus o...

Explain the multiple bus organization structure with neat diagram. The multiple bus organization is using more buses instead of one bus to decrease the number of steps needed an

Rational number expression evaluator, Develop a RPN rational number express...

Develop a RPN rational number expression evaluator (REEval). The learning objectives are: improved procedural programming skills improved confidence in designing and

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