What is a language?
Languages are made of:
non-terminal ::= replacementThe rule means whenever you have what is on the left side of the ::=, you can replace it with what is on the right side.
What strings can the following BNF grammar produce?
Sentence ::= Food Comparator Food
Food ::= Bodo's Bagels
Food ::= Krispy Kreme Donuts
Comparator ::= are better than
Comparator ::= are worse than
What strings can the following BNF grammar produce?
Sentence ::= I like FoodList
FoodList ::= Food
FoodList ::= Food and FoodList
Food ::= Bodo's Bagels
Food ::= Krispy Kreme Donuts
When learning a foreign language, which of primitives, means of
combination or means of abstraction is hardest to learn?
Are there any non-recursive natural languages?
What would happen to a society that spoke one?
What is the difference between a compiler and an interpreter?
I flunked out every year. I never studied. I hated studying. I was just
goofing around. It had the delightful consequence that every year I went
to summer school in New Hampshire where I spent the summer sailing and
having a nice time.
John Backus (Since you probably don't get to spend the summer in New
Hampshire if you flunk out, you may not want to follow his advice here.)
Frankly, we didn't have the vaguest idea how the things would work out
in detail... We struck out simply to optimze the object program, the
running time, because most people at that time believed you really
couldn't do that kind of thing.
John Backus (on FORTRAN language and compiler, quoted in 1966)