Journal
Scientific and technical journal «Priborostroenie»
UDK681.3.062
Issue:11 (57)
Download PDF401 Kbyte
METHOD OF CF-GRAMMAR REGULARIZATION FOR LANGUAGE PROCESSORS
Annotation
A method of context-free regularization based on special equivalent transformations of the grammar syntactic graph is described. In combination with an algorithm of elimination of recursions, the method is shown to ultimately convert a context-free grammar into a regular one.
Keywords
Постоянный URL
Articles in current issue
- CONCEPT OF PROACTIVE CONTROL OVER COMPLEX OBJECTS: THEORETICAL AND TECHNOLOGICAL BASIS
- OPTIMIZATION OF THE ROUTING MATRIX IN QUEUING NETWORKS
- INFORMATION MODEL OF DISTRIBUTED EVENTS SUPPORT AT INTELLIGENT MEETING ROOM
- MODIFIED MODEL OF FLEXIBLE REDISTRIBUTION OF INFORMATION INTERACTION OPERATIONS
- VALUATION MODEL OF SPACECRAFT FUEL CONSUMPTION WITH CONSIDERATION FOR CONTINGENCY
- MODELING AND IDENTIFICATION OF OBJECT-ORIENTED SOFTWARE CODE DEFECTS
- SYNTHESIS OF STRUCTURAL DYNAMICS MODELING SCENARIOS FOR AUTOMATED CONTROL SYSTEM OF ACTIVE MOVING OBJECTS
- STUDY OF DYNAMIC AND ENERGY COMPATIBILITY OF POSITIONING SYSTEM AND ANGULAR MOTION CONTROL OF SPACE SOLAR POWER PLANT
- THE SAMPO+ SYSTEM FOR CREATION AND ANALYSIS OF SOFTWARE HISTORICAL DATABASES
- CONSTRUCTION OF INTEGRATED BASE OF VULNERABILITIES
- SECURE ENCRYPTION PROTOCOL EMPLOYING SHORT KEYS
- MONITORING OF CURRENT SITUATION AND SUPPORT OF DECISION MAKING IN COMPUTER NETWORK SECURITY BASED ON THE SECURITY METRICS SYSTEM