- timer 一个vc++编的时钟小程序
- encrypter source code for testing AES algorithm for adding authentication code to a message. I hpoe to finish this project and update it soon.
- Spytxt 將NI SPY 儀器擷取得的儀器命令檔案(.SPY)轉成文字檔
- redis-desktop-manager 一款redis的桌面管理公园
- Lab12_QPSK Labview code for QPSK Modulation using USRP
- DC_DC_Bidirectional Bidirectional DC
文件名称:parser
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:8.24kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
Elimination of left factoring in the given grammar
For each nonterminal A find the longest prefix (alpha) common to two or more of its alternatives.If alpha is not equal epsilon,i.e..,there is a nontrivial common prefix,replace all the A productions
Aàalpha beta1|alpha beta2|…|alpha betan|gamma
where gamma
represents all alternatives that donot begin with alpha by
AàalphaA’|gamma
A’àbeta1|beta2|…..|betan
Here A’ is the new terminal..
Repeatedly apply this transformation until no two alternatives for a nonterminal have a common prefix.-Elimination of left factoring in the given grammar
For each nonterminal A find the longest prefix (alpha) common to two or more of its alternatives.If alpha is not equal epsilon,i.e..,there is a nontrivial common prefix,replace all the A productions
Aàalpha beta1|alpha beta2|…|alpha betan|gamma
where gamma
represents all alternatives that donot begin with alpha by
AàalphaA’|gamma
A’àbeta1|beta2|…..|betan
Here A’ is the new terminal..
Repeatedly apply this transformation until no two alternatives for a nonterminal have a common prefix.
For each nonterminal A find the longest prefix (alpha) common to two or more of its alternatives.If alpha is not equal epsilon,i.e..,there is a nontrivial common prefix,replace all the A productions
Aàalpha beta1|alpha beta2|…|alpha betan|gamma
where gamma
represents all alternatives that donot begin with alpha by
AàalphaA’|gamma
A’àbeta1|beta2|…..|betan
Here A’ is the new terminal..
Repeatedly apply this transformation until no two alternatives for a nonterminal have a common prefix.-Elimination of left factoring in the given grammar
For each nonterminal A find the longest prefix (alpha) common to two or more of its alternatives.If alpha is not equal epsilon,i.e..,there is a nontrivial common prefix,replace all the A productions
Aàalpha beta1|alpha beta2|…|alpha betan|gamma
where gamma
represents all alternatives that donot begin with alpha by
AàalphaA’|gamma
A’àbeta1|beta2|…..|betan
Here A’ is the new terminal..
Repeatedly apply this transformation until no two alternatives for a nonterminal have a common prefix.
相关搜索: Longest Common Prefix
(系统自动生成,下载前可以参看下载内容)
下载文件列表
parser.docx
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.