DESIGN OF METHODOLOGY FOR INCREMENTAL COMPILER CONSTRUCTION

Abstract HALUZA, P., RYBIČKA, J.: Design of methodology for incremental compiler construction. Acta univ. agric. et silvic. Mendel. Brun., 2011, LIX, No. 7, pp. 137-14

Incremental parsing algorithms for speech-editing mathematics and computer code

The provision of speech control for editing plain language text has existed for a long time, but does not extend to structured content such as mathematics. The requirements of a user interface for a spoken mathematics editor are explored through the lens of an intuitive natural user interface (NUI) for speech control, the desired properties of which are based on a combination of existing literature on NUIs and intuitive user interfaces. An important aspect of an intuitive NUI is timely update of display of the content in response to editing actions. This is not feasible using batch parsing alone, and this issue will be more serious for larger documents such as computer program code. The solution is an incremental parser designed to work with operator precedence (OP) grammars. The contribution to knowledge provided by this thesis is to improve the efficiency in terms of processing time, of the OP incremental parsing algorithm developed by Heeman, and extend it to handle the distfix (mixfix) operators described by Attanayake to model brackets and mathematical functions. This is implemented successfully for the TalkMaths system and shows a greatly reduced response time compared with using batch scanning and parsing alone. The author is not aware of any other incremental OP parser that handles such operators. Furthermore, a proposal is made for modifications to the data structures produced by Attanayake's parser, along with appropriate adjustments to the incremental parser, that will in the future, facilitate application of OP grammar to program code or other structured content by changing the definition of its content language

Automated Reference Librarians for Program Libraries and Their Interaction With Language-Based Editors (Software Engineering, Program Development Tools)

174 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986.An automated reference librarian is a tool that helps programmers find and use objects in program libraries. Its function is similar to that of a human reference librarian: it is to be an expert at locating information. When a client comes to a human librarian with a request for information the librarian directs the client to the information, perhaps giving instruction on how the materials should be used. In the same way, an automated reference librarian helps a client find and use objects in program libraries. This dissertation develops the structure of an automated reference librarian system that is accessed from program development tools such as text and structure-based editors. The benefits of cooperation and information between a librarian and host system, especially a program knowledgeable host, are explored. One benefit to the user of information sharing is that it allows the librarian to extract information from the host program development tool that the user would otherwise have to supply. The synthesis of reference librarian instances, with emphasis on the use of structured editors as a means for processing librarian source data is also discussed. As a contribution towards the availability of program knowledgeable hosts, an incremental LL(1) parsing algorithm for use in language-based editors is presented. Finally, a working prototype of the librarian system is described.U of I OnlyRestricted to the U of I community idenfinitely during batch ingest of legacy ETD