Extended Weak Precedence Functions

スポンサーリンク

概要

• 論文の詳細を見る

• Weak precedence grammars are useful as tools for description of the syntax of programming languages. We considered weak precedence functions with error relations(?), which are modified versions of Aho's error detecting simple precedence functions. We represent three weak precedence relations (≤,>,?) by two pairs of functions, and we call them Extended Weak Precedence Functions (EWPF). We define semistrong equivalence (SSE) to reduce the number of error relations, and show an efficient algorithm to compute EWPF in SSE level. We have shown an algorithm which transforms an unambiguous context-free grammar to a grammar which has EWPF. This algorithm is easy to implement.

• 一般社団法人情報処理学会の論文

著者

• Kaijiri Kenji

  Faculty Of Engineering Shinsyu University

• Kaijiri Kenji

  Faculty Of Engineering Information Engineering

• UCHINAMI Seiichi

  Faculty of Engineering, Osaka University

• TEZUKA Yoshikazu

  Faculty of Engineering, Osaka University

• Tezuka Yoshikazu

  Faculty Of Engineering Osaka University

• Uchinami Seiichi

  Faculty Of Engineering Osaka University

• Uchinami Seiichi

  Faculty Of Computer Science And Systems Engineering Kyushu Institute Of Technology

関連論文

• Extended Weak Precedence Functions
• A Study of Error Correction and Recovery for SLR(k) Parsers
• HELP:Interactive Programming System
• N-14 Application of the Kolb Learning Model in the Design of a Course
• Special Section on Knowledge-Based Software Engineering
• Support tool for an Internet based workshop
• A Method to Develop Feasible Requirements for Java Mobile Code Application
• Information Exchange and Security in a Collaborative Development Support System for Object-Oriented Software

スポンサーリンク