So by this algorithm construct an inclined sketch by which the capacity however can be comfortably handled if we construct an
table II is encoded by two precedence functions f and g that efficient data structure to show acceptably the precedence
represent terminal characters to whole numbers. Two functions f relationship between the terminals. Now it is clear that the data
and g where the following apply: processing capacity is only n*2 where n is the no. of terminal
if x<◦ y then f(x) < g(y) characters. Thus this construction of algorithm for an inclined
if x◦> y then f(x) > g(y) sketch with the vertices showing functional entities permits
if x=◦y then f(x)= g(y) preserving a lot of memory. Using this table as a source, the
operator precedence parser can parse any string given to it as
To frame these functions construct an inclined sketch with input. So in this paper our approach provides a fully declarative
vertices fi and gi where i is the ith terminal adapting the given solution to operator precedence specification for context free
principles: grammar. But this parser finds difficulty to hold token that has
If x=◦ y then fxand fy are grouped together and gx and gy are more than one precedence. So in future our aim is to develop a
grouped together. new method that solves this problem efficiently.
If x◦> y then an inclined edge is drawn from fx to gy.
If x<◦ y then an inclined edge is drawn to fx from gy. References
Applying these principles the precedence sketch for the above 1. Peter Ruzicka (1981). Operator Precedence Parsing
precedence table looks something like this: Algorithm is Polynomial in Time. Kybernetika, 17(5),
368-379.
gid fid 2. Xiao Yang and Jiancheng Wan (2005). A Parsing
Algorithm of Natural Language based on Operator
Precedence. IEEE: Natural Language Processing and
Knowledge Engineering, 73–78, ISBN: 0-7803-9361-9,
f+ g+ + DOI:10.1109/NLPKE.2005.1598710.
3. Xiao Yang, Jiancheng Wan and Yongbo Qiao (2006). A
Binary Combinational Grammar for Chinese and Its
Parsing Algorithm. IEEE, 761-766, ISBN: 0-7695-2528-
g* f* 8, DOI: 10.1109/ISDA.2006.253708.
4. Data Syntax and Semantics (2015). http://www-
compsci.swan. ac.uk/~csjvt/JVTPublications/DSS
(March2006).pdf, 20/07/2015.
f$ g$ 5. Alfered V. Aho, Monica S. Lam, Ravi Sethi and Jeffrey
Figure-1 D. Ullman (2007). Compilers. Pearson Education Inc.,
Precedence Sketch South Asia, 197-200, ISBN-978-81-317-2101-8.
6. WIKIPEDIA (2015) Operator precedence parser,
Now it is easy to make a table for the f and g values of each https://en.wikipedia.org/ wiki/Operator-precedence_parser,
terminal character by signifying f(x) as the long-drawn-out 15/07/2015.
probable route in the sketch starting from fx such that individual
vertex on this route has lower precedence in compare to its 7. D.S. Henderson and M.R. Levy (1976). An Extended
nearby preceding vertex, similarly for g(x) as well. The Operator Precedence Parsing Algorithm. The Computer
resulting precedence function or long-drawn-out route table Journal, 19(3), 229-233.
driven from above sketch is: 8. Arun Petrick (2015). Operator precedence parser,
http://compilerdesigndetails.blogspot.in/2012/02/operator
Table-4 -precedence-parsing.html,05/08/2015.
Precedence Functions
id + * $ 9. Alessandro Barenghi et. al. (2013). PAPAGENO: A
Parallel Parser generator for Operator Precedence
f 4 2 4 0
Grammars. International Journal of Grid and Utility
g 5 1 3 0 Computing (IJGUC), 113(7), 245-249.
10. Shashank Rajput (2015). Operator precedence parser,
Conclusion http://cse.iitkgp.ac.in/~bivasm/notes/scribe/11CS10042.p
df,05/09/2015.
Compilers that use operator precedence parser do not need to
store the table of precedence relations. The data processing