Difference between an interpreted language and a compiled language?

Ans) A compiled language is written and then run by a compiler which checks its syntax and compresses it into a binary executable. Since an interpreted language is not compiled, it must be checked for errors at run-time, which makes it fairly a bit slower than a compiled language (like C or Java). Perl is an example of an interpreted language. Remember, while, that just because a language is interpreted does not necessarily mean it is not full-featured, or simplistic. Perl can get very difficult and very cryptic, very quickly.    

 

 

Posted Date: 4/9/2013 1:28:47 AM | Location : United States

Ask an Expert

Related Discussions:- Interpreted language and a compiled language, Assignment Help, Ask Question on Interpreted language and a compiled language, Get Answer, Expert's Help, Interpreted language and a compiled language Discussions

Write discussion on Interpreted language and a compiled language
Your posts are moderated

Write your message here..

Related Questions

Describe about digital audio tape, Q. Describe about Digital Audio Tape? ... Q. Describe about Digital Audio Tape? The most proper tape for backing up data from a disk today is Digital Audio Tape (DAT). It employs a 4mm tape covered in a cartridge. It e

Where time synchronization is necessary, Time synchronization is necessary ... Time synchronization is necessary in? Time synchronization is essential in TDM.

Why are binary, Q. Why are binary, octal and hexadecimal used for computer ... Q. Why are binary, octal and hexadecimal used for computer applications? Q. Perform the following: (189.3) 10 = (?) 2

Mac and llc, how can we improve the way LLC and MAC are used for LAN operat... how can we improve the way LLC and MAC are used for LAN operation.?

Explain about zip drive, Q. Explain about Zip Drive? Zip Drive: Loads... Q. Explain about Zip Drive? Zip Drive: Loads of files, Volumes of data have definitely increased onus on today's computer user and protection of this data is what bugs every

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

Binary resolution - artificial intelligence, Binary Resolution: We look... Binary Resolution: We looked at unit resolution (a propositional inference law) in the last lecture: A ∨ B,   ¬B /A We may have this a bit further to propositional bin

What is device drivers, A device driver is software interface that manages ... A device driver is software interface that manages communication with and control of a particular I/O device or type of device. It is task of device driver to convert logical reque

Multiple stack, how to implement the multiple stack how to implement the multiple stack

Application and function areas - artificial intelligence, Application and F... Application and Function Areas - artificial intelligence: Individual applications and function often drive "AI" research much more than the long term relative field described