@article{oai:soar-ir.repo.nii.ac.jp:00012532,
 author = {海尻,  賢二 and 打浪,  清一 and 手塚,  慶一},
 issue = {6},
 journal = {情報処理},
 month = {Jun},
 note = {Weak precedence grammars are useful tools for description of the syntax of programming languages. We have considered the weak precedence function (WPF) with an error relation (?), and this method is a modified version of Aho's error detecting simple precedence functions. We represent the three weak precedince relations (⩿, >dot;, ?) by two pairs of functions, and we call them the Extended Weak Precedence Functions (EWPF). We define the semi-strong equivalence (SSE) to reduce the number of error relations, and show an efficient algorithm to compute the EWPF in SSE level. We have shown an algorithm which transforms an unambiguous context free grammar to a grammar which has the EWPF. This algorithm is easy to implement. As an example, we have shown the EWPF for JIS ALGOL 3000 using it., Article, 情報処理. 18(6):542-549 (1977)},
 pages = {542--549},
 title = {拡張弱順位関数},
 volume = {18},
 year = {1977}
}