Примери коришћења Backus на Енглеском и њихови преводи на Српски
{-}
-
Colloquial
-
Ecclesiastic
-
Computer
-
Latin
-
Cyrillic
Backus witnessed it.
Garcia, you have anything yet on Todd Backus?
Mark Backus, the shooting victim.
There it is. Wade Burke's father gave Backus a job.
But it's like Todd Backus… he's never done anything wrong in his entire life.
The first really successful high-level language was FORTRAN 1,developed between 1954-1957 by a team at IBM led by John Backus.
Todd Backus, 72-year-old widower, retired, lives by himself not too far from here.
A key distinction from functional languages is that Backus' language has the following hierarchy of types.
Jesse Backus, late 20s, six feet, 220 pounds, star tattoo on his right arm.
In my favorite paper on the subject,which is entitled,“Why I Don't Have a Girlfriend”-(Laughter)- Peter Backus tries to rate his chances of finding love.
Sterling Backus said his background as a"gear head" has thus far been more helpful than his training as as a physicist.
The first widely known and successful high-level programming language was Fortran,developed from 1954 to 1957 by a team of IBM researchers led by John Backus.
Backus, not insulted, agreed with the interviewer's premise and readily acknowledged that his popular series, indeed, was not Shakespeare.
Okay you may hate math, you may not like science, you may not like language arts, you may not even like art, butit all comes together with this one project," Xander Backus said.
Backus originally used the term object-level programming but that term is now prone to confusion with object-oriented programming.
The car won't be a proper Lamborghini, it contains a Corvette V8 engine and various parts procured from a junkyard,including Porsche components, but Backus said it will look like the real thing.
Backus calls functional programming applicative programming; his function-level programming is a particular, constrained type.
For instance, the general question of equality of two functions is equivalent to the halting problem, and is undecidable, but equality of two functions in FP is just equality in the algebra,and thus(Backus imagines) easier.
John Backus and Peter Naur developed a context free grammar to define the syntax of a programming language by using two sets of rules.
In his 1977 Turing award lecture, Backus set forth what he considered to be the need to switch to a different philosophy in programming language design:[1].
In Spring 1949 Backus visited the IBM Computer Center where he toured the Selective Sequence Electronic Calculator(SSEC), one of IBM's early electronic computers.
In his 1977 Turing award lecture, Backus set forth what he considered to be the need to switch to a different philosophy in programming language design: Programming languages appear to be in trouble.
John Backus For profound, influential, and lasting contributions to the design of practical high-level programming systems, notably through his work on FORTRAN, and for seminal publication of formal procedures for the specification of programming languages.
In fact, Backus would not have disagreed with the'restrictive' accusation: he argued that it was precisely due to such restrictions that a well-formed mathematical space could arise, in a manner analogous to the way structured programming limits programming to a restricted version of all the control-flow possibilities available in plain, unrestricted unstructured programs.
A key distinction from functional languages is that Backus' language has the following hierarchy of types: atoms functions, which take atoms to atoms Higher-order functions(which he calls"functional forms"), which take one or two functions to functions… and the only way to generate new functions is to use one of the functional forms, which are fixed: you cannot build your own functional form(at least not within FP; you can within FFP(Formal FP)).