- Семеріков, С.О. (orcid.org/0000-0003-0789-0272) and Поліщук, О.П. (2015) Methodic of joint using the tools of automation of lexical and parsing analysis in the process of teaching the programming theory of future informatics teachers Theory and methods of learning mathematics, physics, informatics, 2(36) (13). pp. 174-200. ISSN 2309-1479
Preview |
Text
174-200_Semerikov_Polishchuk.pdf - Published Version Download (521kB) | Preview |
Abstract
Research goals: to develop a methodic of joint using the tools of automation of lexical (lex) and parsing (yacc) analysis in the process of teaching the programming theory based on a functional paradigm. Research objectives: to determine the place and role of parsing analysis in the formation of professional informatics competences of future informatics teachers; to define tools of compilers development automation in teaching the programming theory; to develop the main components of the methodic of joint using the tools of automation of lexical and parsing analysis in the process of teaching the programming theory of future informatics teachers. Object of research: teaching the programming theory of future informatics teachers. Subject of research: the use of the tools of automation of lexical and parsing analysis in the process of teaching the programming theory of future informatics teachers. Research methods used: analysis of scientific publications, self-analysis of work experience, methodic design. Results of the research. The place and role of parsing analysis in formation of professional informatics competences of future informatics teachers is determined. Separated automation tools for lexical (lex) and syntax (yacc) analysis invariant to the programming language used. The expediency of using functional programming languages Scheme and SML is shown for learning how to develop compilers in the course of programming theory. The example of the MosML dialect illustrates the main components of the methodic of joint using the tools of automation of lexical and parsing analysis in the process of teaching the programming theory of future informatics teachers. The main conclusions and recommendations: 1) the considered example of the expanded calculator can be refined by changing the grammar, in particular – for the introduction of conditional and cyclic constructions; 2) the proposed scheme can be used to implement the interpreter of any formal language with an arbitrary typing method – the appropriate examples of study will be subsets of procedural languages Basic and C and functional languages Scheme and SML: provided the addition of the machine code generation phase, this provides an opportunity to demonstrate the full development cycle for programming language compiler.
Downloads
Downloads per month over past year
Actions (login required)
View Item |