The Grammar of a computer language is an essential part of parsing a computer language. The most common way to store a Grammar is to use the Extendend Backus Naur Format (EBNF named after John Backus and Peter Naur). The EBNF of most language are available on the internet, but are not complete. To use these grammars for parsing a complete application for translation purposes it is almost often necessary to make additions/changes, because:
- An absolute grammar does not exist and should not be made.
- The grammar should fit to the solution it is intended for.
- Programmers have their own style. So no computer program is written in the same manner.
- Platform (or other) specific language implementations.
For the translation of a computer language into another at least 2 different EBNF's are necessary. One is used for the parsing process, the other as a template for/definition of the destination language.
- Parser Links, Collection of all links related to paring.
- Javacc, Parsing tool written in Java.
- Software migration, Description of Business Application Modernization (BAM) Software migration.
- Translators, Automating migration of code or translating code.
See also the internal links for a list of all related links.
- http://www.cs.vu.nl/grammars Engineering of Grammarware at the VU in Amsterdam.
activities on the subject of engineering of grammarware.
- VS COBOL II grammar Version 1.0.4, VU Amsterdam
- Wikipedia EBNF