Joel Soon

Kris Eder
Nicole Agsalda
Kennedy Valenzuela
The researchers came up with the idea of
developing a Lexical, Syntax and
Semantic Analyzer that will allow the
users to test syntax of a grammar using
java as the programming language and
its concepts for a clear view of sequence.

This study will feature the use of JavaCC
as a parser generator and Java as a
programming language in order to create
a Front-End compiler that is capable of
checking the syntax and analyzing the
lexical characteristics of the grammar.
BNF (Backus Normal Form or BackusNaur
Form)

Finite Automata
1. NFA (Non Deterministic Finite Automaton)
2. DFA (Deterministic Finite Automaton)

With the Use of the theory cited, the
researchers decided to make a system
that will analyze the expression that
serve as an input into the semantic and
lexeme analyzer to prove if the grammar
is accepted or rejected and what token it
belongs The system will only analyze the
declaration of a variable only.