diceidea

parser

常用链接

Others

有用的东西

最新评论

dev log(1)

Summary for last week:

1. Understand the basic of lexical parse and syntax parse, know what they are used for separately. The former with regular expression to recognize tokens, the latter using operator precedence/recursive descent to build a syntax tree for continuing step, e.g, computing the math expression. The former is considered on character, while the latter is on token.

2. Have a superficial knowledge in Automate, know how to build a FA for specific regular expression and reduce e-FA to FA, if the result is NFA, then convert to DFA

3. I find rolling dice can reduce to a SM.

 

Todo in coming week:

1. Study the internal lexical and syntax parts of muParser.

2. Write code for my own math expression parser.

3. Add 'If' and 'while' to the parser using my own way, then read more in Parsing related Docs for better solution.

 

Time stamp:

1:00 May.12.2008

posted on 2008-05-12 11:50 diceidea 阅读(275) 评论(0)  编辑 收藏 引用 所属分类: Dev log


只有注册用户登录后才能发表评论。
网站导航: 博客园   IT新闻   BlogJava   知识库   博问   管理