Lea writes:
> Inefficiency? Aren't all interpretive languages inefficient by
> definition versus compiled languages?

  Maybe, it depends.

  Many interpreted languages call well coded / compiled routines, so the
majority of the execution time very well may be in the routines.  (Think
APL. :-)

  It also depends on whether "inefficient" applies only to the execution
time, or includes the development and testing times.  So, e.g., a short
Perl script which applies a regular expression to a file and emits some
summary results very well might be a much more efficient overall process
than would result from using a compiled language.
--
--henry schaffer

----------------------------------------------------------------------
For LINUX-390 subscribe / signoff / archive access instructions,
send email to [EMAIL PROTECTED] with the message: INFO LINUX-390 or visit
http://www.marist.edu/htbin/wlvindex?LINUX-390

Reply via email to