Abstract
This chapter discusses features of natural language in programming language. Some features of natural languages are reproduced in the programming language even though the language designer is not always aware of it. The simplest example of this phenomenon is what is known in programming as “Backus normal form” and in linguistics as “context-free phrase-structure grammars.” Hardware binary code or a simple assembler language is usually defined without context-free grammars (the syntax of such a language is essentially finite state); the evolution of programming languages has created a feature that has been independently discovered in natural languages. Mathematical theories based on the predicate logic are so far the only instances of languages that have exactly defined proof (or problem-solving) procedures.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
