function ll_start($s) { $t = array(); foreach($this->rule as $rule) if($rule[0] == $rule[1]) $t[] = $rule; if($t) { foreach($t as $rule) printf(&＃39;| %s 存在左递归 |
&＃39;, preg_replace(&＃39;/ /&＃39;, &＃39; → &＃39;, join(&＃39; &＃39;, $rule), 1)); return; } $stack = array(&＃39;#&＃39;, key($this->forecast)); $i = 0; $step = 1; $timeout = 10 * strlen($s); while($stack && $i forecast[$r][$s{$i}])) $msg = $r . &＃39; → &＃39; . join(&＃39; &＃39;, array_reverse($this->forecast[$r][$s{$i}][0])); else $msg = &＃39;错误&＃39;; printf("| %d | %s | %s | %s |
", $step++, substr(join(&＃39;&＃39;, $stack), -50), substr($s, $i), $msg); if($r == $s{$i}) { array_pop($stack); $i++; }elseif(isset($this->forecast[$r][$s{$i}])) { array_pop($stack); if(current($this->forecast[$r][$s{$i}][0]) != &＃39;#&＃39;) $stack = array_merge($stack, $this->forecast[$r][$s{$i}][0]); }else break; } } function lr_start($s) { $State = array(0); //状态栈 $Symbol = array(&＃39;#&＃39;); //符号栈 $i = 0; $step = 1; $timeout = 10 * strlen($s); while($i action[$sp][$ch]) && $this->action[$sp][$ch][0] == &＃39;r0&＃39;) $msg = &＃39;acc&＃39;; if(isset($this->request[$sp][$ch])) $request = preg_replace(&＃39;/ /&＃39;, &＃39; → &＃39;, join(&＃39; &＃39;, $this->rule[$this->request[$sp][$ch]]), 1); else $request = &＃39;error&＃39;; printf("| %d | %s | %s | %s | %s |
|---|
", $step++, substr(join(&＃39;&＃39;, $State), -50), join(&＃39;&＃39;, $Symbol), $msg, $request); if(isset($this->action[$sp][$ch]) isset($this->goto[$sp][$ch])) { $t = isset($this->action[$sp][$ch]) ? $this->action[$sp][$ch][0] : $this->goto[$sp][$ch]; $n = substr($t, 1) + 0; if($t{0} == &＃39;r&＃39;) { for($j=0; $jrule[$n])-1; $j++) { array_pop($State); array_pop($Symbol); } if($n == 0) break; $c = $Symbol[] = $this->rule[$n][0]; $State[] = $this->goto[end($State)][$c]; }elseif($t{0} == &＃39;S&＃39;) { $State[] = $n; $Symbol[] = $ch; $i++; }else ; }else break; } } function report($in=&＃39;&＃39;) { if($in) $in = trim($in, &＃39;#&＃39;) . &＃39;#&＃39;; echo &＃39;&＃39;; echo &＃39;| 文法 |
&＃39;; foreach($this->rule as $rule) { echo &＃39;| &＃39;; echo preg_replace(&＃39;/ /&＃39;, &＃39; → &＃39;, join(&＃39; &＃39;, $rule), 1); echo &＃39; |
&＃39;; } echo &＃39;
&＃39;; $identifier = $this->identifier; echo &＃39;| 标识符 | &＃39;; echo &＃39;&＃39; . join(&＃39; &＃39;, $identifier) . &＃39; |
&＃39;; echo &＃39;
&＃39;; $leay = array_diff($this->leay, array(&＃39;#&＃39;)); $leay[] = &＃39;#&＃39;; echo &＃39;| 终结符 | &＃39;; echo &＃39;&＃39; . join(&＃39; &＃39;, $leay) . &＃39; |
&＃39;; echo &＃39;
&＃39;; echo &＃39;$s"; }else $s .= &＃39; &＃39;; echo &＃39;| &＃39; . $s . &＃39; | &＃39;; } echo &＃39;&＃39;; } echo &＃39;
&＃39;; echo &＃39;&＃39;; if($in) { echo &＃39;| 测试字符串 | &＃39;; echo &＃39;&＃39; . trim($in, &＃39;#&＃39;) . &＃39; |
|---|
&＃39;; echo &＃39;| $i | "; foreach($leay as $v) { $s = isset($item[$v]) ? join(&＃39;,&＃39;, $item[$v]) : &＃39; &＃39;; if(strpos($s, &＃39;,&＃39;)) $s = "$s"; echo "$s | "; } foreach($identifier as $v) { $s = isset($this->goto[$i][$v]) ? $this->goto[$i][$v] : &＃39; &＃39;; echo "$s | "; } echo &＃39;&＃39; . $this->showDFA($i) .&＃39; | &＃39;; echo &＃39;&＃39;; } echo &＃39;
&＃39;; if($in) { echo &＃39;| 测试字符串 | &＃39;; echo &＃39;&＃39; . trim($in, &＃39;#&＃39;) . &＃39; |
|---|
&＃39;; echo &＃39;report($S);
ttrie.php
- PHP code
-
$v) $this->set($k, $v); return; } $p = count($this->dict); $cur = 0; //当前节点号 foreach(str_split($word) as $c) { if (isset($this->dict[$cur][$c])) { //已存在就下移 $cur = $this->dict[$cur][$c]; continue; } $this->dict[$p]= array(); //创建新节点 $this->dict[$cur][$c] = $p; //在父节点记录子节点号 $cur = $p; //把当前节点设为新插入的 $p++; } $this->dict[$cur][&＃39;acc&＃39;] = $action; //一个词结束，标记叶子节点 } function match($s) { $ret = array(); $cur = 0; //当前节点，初始为根节点 $i =& $this->input; //字符串当前偏移 $p =& $this->backtracking; //字符串回溯位置 $s .= "/0"; //附加结束符 $len = strlen($s); $buf = &＃39;&＃39;; while($i <$len) { $c = $s{$i}; if(isset($this->dict[$cur][$c])) { //如果存在 $cur = $this->dict[$cur][$c]; //转到对应的位置 if(isset($this->dict[$cur][$s[$i+1]])) {//检查下一个字符是否也能匹配，长度优先 $i++; continue; } if(isset($this->dict[$cur][&＃39;acc&＃39;])) { //是叶子节点，单词匹配！ if($buf) { $this->buffer[] = $buf; $buf = &＃39;&＃39;; } if($this->savematch) $this->buffer[] = substr($s, $p, $i - $p + 1); //取出匹配位置和匹配的词 $ar = explode(&＃39;,&＃39;, $this->dict[$cur][&＃39;acc&＃39;]); call_user_func_array( array($this, array_shift($ar)), $ar ); $p = $i + 1; //设置下一个回溯位置 $cur = 0; //重置当前节点为根节点 } } else { //不匹配 $buf .= $s{$p}; //substr($s, $p, $i - $p + 1); //保存未匹配位置和未匹配的内容 $cur = 0; //重置当前节点为根节点 $i = $p; //把当前偏移设为回溯位置 $p = $i + 1; //设置下一个回溯位置 } $i++; //下一个字符 } if(trim($buf, "/0")) $this->buffer[] = trim($buf, "/0"); } function __call($method, $param) { if($this->debug) printf("偏移:%d 回溯:%d/n", $this->input, $this->backtracking); } }
欢迎大家阅读《分享我写的PHP文法分析的源码_php》,跪求各位点评,若觉得好的话请收藏本文，by
/phpzx/49355.htmlwww.phpzy.comtrue/phpzx/49355.htmlTechArticle分享我写的PHP文法分析的源码_php 最近尝试做了文法分析的东东，问题较多。 请提建议。代码放不下，分两页。 下载地址 http://download.csdn.net/detail/xuzuning/4529066 php code include ttrie.php; c...
PHP之友评论