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

Explain routing tone in strowger telephony, Explain routing tone in strowge...

Explain routing tone in strowger telephony with waveforms and the timings. The call-in-progress tone or routing tone is a 400 Hz or 800 Hz intermittent pattern. In electromec

Determine the number of classes of ip addresses, The total number of class ...

The total number of class of IP address are? The total number of class of IP addresses are 5.

Difference between classical ai and statistical ai, Statistical AI, arising...

Statistical AI, arising from machine learning, tends to be more concerned with "inductive" thought: given a set of patterns, make the trend. Classical AI, on the other hand, is mor

Explain working neural network work, Q. Explain working neural network work...

Q. Explain working neural network work? ANSWER: A neural network has an input layer with the factors under consideration, a middle or hidden layer that assigns and adjusts weig

What is garbage collection and what is it used for, In computer science, ga...

In computer science, garbage collection (GC) is a form of automatic memory management. The garbage collector, or just collector, attempts to reclaim garbage, or memory occupied by

Drawback of the system using disk caching, Q. Drawback of the system using ...

Q. Drawback of the system using disk caching? The main drawback of the system using disk caching is risking loss of updated information in event of machine failures like loss o

Define coupling, Define Coupling? Coupling means the measure of interco...

Define Coupling? Coupling means the measure of interconnection between modules in a program structure. It depends on the interface problem between modules.

How do you decide which integer type to use, It depends on our requirement....

It depends on our requirement. When we are needed an integer to be stored in 1 byte (means less than or equal to 255) we use short int, for 2 bytes we use int, for 8 bytes we use l

Define relocatable programs, Relocatable programs? Ans. Relocatable pro...

Relocatable programs? Ans. Relocatable programs can be loaded almost anywhere inside the memory.

Explain resource request and allocation graph (rrag), Explain Resource requ...

Explain Resource request and allocation graph (RRAG) Deadlocks can be explained by a directed bipartite graph known as a Resource-Request-Allocation graph (RRAG).A graph G = (V

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