UCSY's Research Repository

Implementation of Syntax Analyzer by using JavaCC

Show simple item record

dc.contributor.author Htun, Aye Thiri
dc.contributor.author Hlaing, Swe Zin
dc.date.accessioned 2019-08-04T17:47:57Z
dc.date.available 2019-08-04T17:47:57Z
dc.date.issued 2009-12-30
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/1717
dc.description.abstract A language compiler is one of the most crucial tools for the system development. Java Compiler Compiler (JavaCC) [tm] is the most popular parser generator for use with Java [tm] applications. For a given a context free grammar, it generates a recursive decent parser written in Java. A recursive descent parser defines a subroutine for each nonterminal in the grammar. Each subroutine is responsible for recognizing a sequence of terminal symbols produced by its nonterminal, and for removing that sequence of terminal symbols from the input sequence. It reads a grammar specification and converts it to a Java program. It can on any computer platform with a Java Virtual Machine. In this paper, we analyze and describe how to build a parser by applying JavaCC. We use LL (1) grammar rules, Left to Right scanning using one lookahead token. The proposed system is implemented by Java Programming Language. en_US
dc.language.iso en en_US
dc.publisher Fourth Local Conference on Parallel and Soft Computing en_US
dc.subject Java Compiler Compiler (JavaCC) en_US
dc.subject recursive decent parser en_US
dc.subject context free grammar en_US
dc.subject Java Virtual Machine en_US
dc.subject LL(1) Grammar en_US
dc.subject lookahead token en_US
dc.title Implementation of Syntax Analyzer by using JavaCC en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository



Browse

My Account

Statistics