TAILIEUCHUNG - Báo cáo khoa học: "AN EXTENDED LR PARSING ALGORITHM FOR GRAMMARS USING FEATURE-BASED SYNTACTIC CATEGORIES "

This paper proposes an LR parsing algorithm modified for grammars with feature-based categories. The proposed algorithm does not instantiate categories during preprocessing of a grammar as proposed elsewhere. As a result, it constructs a minimal size of GOTO/ACTION table and eliminates the necessity of search for GOTO table entries during parsing. | AN EXTENDED LR PARSING ALGORITHM FOR GRAMMARS USING FEATURE-BASED SYNTACTIC CATEGORIES Tsuneko Nakazawa Beckman Institute for Advanced Science and Technology and Linguistics Department University of Illinois 4088 FLB 707 s. Mathews Urbana IL 61801 USA tsuneko@ ABSTRACT This paper proposes an LR parsing algorithm modified for grammars with feature-based categories. The proposed algorithm does not instantiate categories during preprocessing of a grammar as proposed elsewhere. As a result it constructs a minimal size of GOTO ACTION table and eliminates the necessity of search for GOTO table entries during parsing. 1 Introduction The LR method is known to be a very efficient parsing algorithm that involves no searching or backtracking. However recent formalisms for syntactic analyses of natural language make maximal use of complex feature-value systems rather than atomic categories that have been presupposed in the LR rnethod. This paper is an attempt to incorporate feature-based categories into Tomita s extended LR parsing algorithm Tomita 1986 . A straightforward adaptation of featurebased categories into the algorithm introduces the necessity of partial instantiation of categories during preprocessing of a grammar as well as a nontermination problem. Furthermore the parser is forced to search through instantiated categories for desired GOTO table entries during parsing. The major innovations of the proposed algorithm include the construction of a minimal size of GOTO table that does not require any preliminary instantiation of categories or a search for them and a reduce action which performs instantiation during parsing. Some details of the LR parsing algorithm are assumed from Aho and Ullman 1987 and Aho and Johnson 1974 and more formal definitions and notations of a featurebased grammar formalism from Pollard and Sag 1987 and Shieber 1986 . 2 The LR Parsing Algorithm The LR parser is an efficient shift-reduce parser with optional lookahead. .

TỪ KHÓA LIÊN QUAN
TAILIEUCHUNG - Chia sẻ tài liệu không giới hạn
Địa chỉ : 444 Hoang Hoa Tham, Hanoi, Viet Nam
Website : tailieuchung.com
Email : tailieuchung20@gmail.com
Tailieuchung.com là thư viện tài liệu trực tuyến, nơi chia sẽ trao đổi hàng triệu tài liệu như luận văn đồ án, sách, giáo trình, đề thi.
Chúng tôi không chịu trách nhiệm liên quan đến các vấn đề bản quyền nội dung tài liệu được thành viên tự nguyện đăng tải lên, nếu phát hiện thấy tài liệu xấu hoặc tài liệu có bản quyền xin hãy email cho chúng tôi.
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.