Related articles |
---|
About the development of a formulation parser. liuxin0916@hotmail.com (2003-09-09) |
From: | liuxin0916@hotmail.com (Edward Liu) |
Newsgroups: | comp.compilers |
Date: | 9 Sep 2003 22:52:57 -0400 |
Organization: | http://groups.google.com/ |
Keywords: | parse, question |
Posted-Date: | 09 Sep 2003 22:52:56 EDT |
I am trying to develop a formulation parcer. The formulation will be
recursive formally. For example: M(i,j) = max{M(i-1,j-1), M(i-1,j),
M(i,j-1)}.
I am a novice in using lex/yacc. I want to know where I can find some
useful references or source codes to help me develop this tool.
Thanks!
Return to the
comp.compilers page.
Search the
comp.compilers archives again.