Implementing Syntax analyzer For Compilation Process

Abstract

This paper is written to determine whether a string of tokens can be generated by a language grammar. The grammar specifies the structure of the language. Context free grammar is used to define the grammar of the input source language of a compiler. It is also known as Type-2 grammar. Syntax analysis can be done by two main techniques top-down and bottom-up. But almost all of the compilers used bottom-up technique. This papers is implemented as a syntax Analyzer for checking C++ program source code. In this paper uses bottom-up technique and Context free grammar to construct Syntax Analyzer. This system accepts C++ source code as an input and check whether there are syntax errors or not. If there are syntax errors, the system generate the error message with the suggested error line. If there are no syntax errors, the system generate the message there is no syntax errors.