[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Low-level vs. High-level programming (was My First Computer)
- Subject: Re: Low-level vs. High-level programming (was My First Computer)
- From: "Kelly Hall" <hall@priest.com>
- Date: Sun, 22 Jun 2003 08:56:47 GMT
- Newsgroups: comp.sys.cbm, comp.sys.apple2, rec.games.video.classic, comp.os.cpm
- Organization: SBC http://yahoo.sbc.com
- References: <7a1fd8df.0301181540.30e19a40@posting.google.com> <l%1Ia.120$RK2.11917426@newssvr21.news.prodigy.com> <%82Ia.34625$QS4.4604@fe05.atl2.webusene <038073c84e3fe3a00a40ffb3fe9d76b5@TeraNews> <bcvu45$1tjm$1@merope.saaf.se> <9856b2ab0276084facaaa804f3a5f414@TeraNews> <aA4Ja.10576$bH3.2854@fe02.atl2.webusenet.com>
- Xref: archiver1.google.com comp.sys.cbm:59060 comp.sys.apple2:31712 rec.games.video.classic:59232 comp.os.cpm:13461
"Randy McLaughlin" <randy@nospam.com> wrote in message
news:aA4Ja.10576$bH3.2854@fe02.atl2.webusenet.com...
> I have yet to find a definition of a programming language better than a
> language used to program a computer.
For myself, I define a 'computer programming language' as some formalized
syntax and semantics that express computation sufficient to model a Turing
machine. I'm not picky what sort of formalisms one uses; traditionally,
Extended Backus-Naur Form (EBNF) is handy for syntax, and there are lots of
different formalisms for semantics (translational, operational,
denotational - pick whatever you like). I insist on Turing-completeness
because frankly anything less seems pretty boring. This definition doesn't
preclude non-textual programming languages; you'll just need to use a
different formalism for the syntax.
While HTML has a formal syntax, the semantics is somewhat vague and
certainly the language is not Turing-complete. Thus, I don't consider HTML
a 'computer programming language'.
Of course, you may define 'computer programming language' any way that makes
good sense to you.
> One person posted two references about
> computer programming languages, but all they did was name a couple of
> languages and stated the languages are broken into different gl classes,
but
> no definition of what a language must contain to be a language.
Does my definition meet your criteria? If you want, you can google 'EBNF'
and 'denotational semantics' and 'Turing completeness' - they are well
understood concepts in computer science.
Kelly