We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

+ Link For Past Papers, Solved MCQs, Short Notes & More


Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

How to Add New Discussion in Study Group ? Step By Step Guide Click Here.

consult the information on following link.

http://en.wikibooks.org/wiki/Computability_and_Complexity/Formal_La...Please

+ How to Follow the New Added Discussions at Your Mail Address?

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?


See Your Saved Posts Timeline

Views: 215

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

+ Click Here To Join (Our facebook study Group)

Replies to This Discussion

First of all, high-level languages cannot enhance assembly since that is able to express everything the CPU can do. Basically, what a compiler generally does is to generate assembly or machine code (which has a 1:1 mapping to assembly language). The advantage of high-level languages can be simplicity, maintainability and portability.

It is possible to combine assembly with other languages if said languages support this. What you need to do is to assemble and compile the source files separately and then link the resulting object files (not executables!) with a linker. To support this, most assemblers/compilers have directives like to indicate whether a symbol is external or to be exported.

Furthermore, some languages support inline assembly (i.e., embedding assembly code directly in the source). For instance, the optional "asm" keyword in C and C++ indicates that a piece of code is to be assembled. The syntax and usage of this keyword varies from compiler to compiler so you need to check the documentation or at least look for examples.

A formal languages set is superset of regular languages set and there may be formal languages which are not regular language. Actually, formal language is a set of finite strings of letters and symbols. A regular language is possibly infinite set of finite sequences of symbols from a finite alphabet. Therefore, regular language and formal language are the same language because these are generated by a prefix and regular grammar. These are defined in monadic second order logic and these can be accepted by a deterministic and nondeterministic finite state machine. Hence, we can saw that, formal language set and regular language set has same properties so regular language is subset of formal language.

 

 

Change it according your setting thanks

CS402 GDB data

See the attached file please

Attachments:
In theoretical computer science, a regular language is a formal language that satisfies the following equivalent properties:
it can be accepted by a deterministic finite state machine.
it can be accepted by a nondeterministic finite state machine
it can be accepted by an alternating finite automaton
it can be described by a formal regular expression. Note that the "regular expression" features provided with many programming languages are augmented with features that make them capable of recognizing languages which are not regular, and are therefore not strictly equivalent to formal regular expressions.
it can be generated by a regular grammar
it can be generated by a prefix grammar
it can be accepted by a read-only Turing machine
it can be defined in monadic second-order logic
it is recognized by some finitely generated monoid
it is the preimage of a subset of a finite monoid under a homomorphism from the free monoid on its alphabet
A formal language is basically a set of words over some alphabet. A regular language is a formal language with specific constraints. The set of formal languages therefore includes all regular languages, therefore it is a superset.

RSS

Latest Activity

© 2020   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service

.