An Ambiguous Context -Free Grammar for Deterministic Parsing In Queue- Java Compiler

We present in this paper an ambiguous and context free grammar (AFEG) for a deterministic parsing phase in a Queue-Java compiler, which is based on Queue programming paradigm and is targeted for a novel Queue-Java computing system. We shall show how the AFEG provides a clear and precise description of those strings that make up Java and Queue-Java programming. For every item, we will propose more than one rule and we will investigate, then, their usage rate. Selected rules were used in AFEG and implemented for our QJAVAC compiler that embed Queue Syntax tree Algorithm (QST).