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

Solve the assignment of finite automata, Solve the assignment of NFA-- Fini...

Solve the assignment of NFA-- Finite Automata and Formal Language Project Description: I have an assignment on Finite Automata and Formal Languages ( Nondeterministic Fini

What are the advantages of a smart card, What are the advantages of a Smart...

What are the advantages of a Smart Card? Advantages of Smart Card as given below: a. This provides convenience and assists for multiple currencies over borders. b. Us

What is link destruction, What is link destruction? Link destruction is...

What is link destruction? Link destruction is inverse of link creation. When a link is destroyed makes sure the associated objects accessible by other handles or intentionally

What are the main functions of sound cards, Q. What are the main functions ...

Q. What are the main functions of sound cards? Sound card (The card is frequently directly built into motherboards these days) is a board that has digital to analog sound conve

Explain turing reducibility, Explain Turing reducibility?  Exponential ...

Explain Turing reducibility?  Exponential time algorithms typically happens when we solve by searching by a space of solutions known as brute -force search

Example on multi-statement forall construct, Q. Example on Multi-statement ...

Q. Example on Multi-statement FORALL construct? The subsequent statements set every element of matrix X to sum of its indices.  FORALL (i=1:m, j=1:n)      X(i,j) = i+j an

Explain vector-scalar instructions, Vector-Scalar Instructions In this ...

Vector-Scalar Instructions In this category, when combination of vector and scalar are fetched and stored in vector register. These instructions are referred with the subsequen

Java, A string S is said to be "Super ASCII", if it contains the character ...

A string S is said to be "Super ASCII", if it contains the character frequency equal to their ascii values. String will contain only lower case alphabets (''a''-''z'') and the asci

Explain an exceptional handling in java with an example, Explain an excepti...

Explain an exceptional handling in java with the help of suitable example. Java exception handling is managed through five keywords: catch, try, throw, finally and throws. Th

What is the significance of asp.net routing, ASP.NET MVC uses ASP.NET routi...

ASP.NET MVC uses ASP.NET routing, to map incoming browser requests to controller action process. ASP.NET Routing makes use of route table. Route table is formed when your web appli

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