scholarly journals Building XML-driven application generators with compiler construction tools

2012 ◽  
Vol 9 (2) ◽  
pp. 485-504 ◽  
Author(s):  
Antonio Sarasa-Cabezuelo ◽  
Bryan Temprado-Battad ◽  
Daniel Rodríguez-Cerezo ◽  
José-Luis Sierra
Keyword(s):  
Syntactic Structure ◽  
Specific Context ◽  
Compiler Construction ◽  
Shortest Route ◽  
Parser Generation ◽  
High Level ◽  
Opening And Closing ◽  
Context Free ◽  
Route Search ◽  
Generation Technology

This paper describes how to use conventional compiler construction tools, and parser generators in particular, to build XML driven application generators. In our approach, the document interface is provided by a standard stream-oriented XML processing framework (e.g., SAX or StAX). This framework is used to program a generic, customizable XML scanner that transforms documents into streams of suitable tokens (opening and closing tags, character data, etc.). The next step is to characterize the syntactic structure of these streams in terms of generation-specific context-free grammars. By adding suitable semantic attributes and semantic actions to these grammars, developers obtain generation-oriented translation schemes: high-level specifications of the generation tasks. These specifications are then turned into working application generators by using standard parser generation technology. We illustrate the approach with <e-Subway>, an XML-driven generator of shortest-route search applications in subway networks.

scholarly journals Multi-purpose Syntax Definition with SDF3

2020 ◽  
pp. 1-23 ◽  
Author(s):  
Luís Eduardo de Souza Amorim ◽  
Eelco Visser
Keyword(s):  
Error Recovery ◽  
Abstract Syntax ◽  
Abstract Syntax Tree ◽  
Syntax Tree ◽  
Full Class ◽  
High Level ◽  
Modular Composition ◽  
Tree Representations ◽  
Context Free ◽  
Context Free Grammars

Abstract SDF3 is a syntax definition formalism that extends plain context-free grammars with features such as constructor declarations, declarative disambiguation rules, character-level grammars, permissive syntax, layout constraints, formatting templates, placeholder syntax, and modular composition. These features support the multi-purpose interpretation of syntax definitions, including derivation of type schemas for abstract syntax tree representations, scannerless generalized parsing of the full class of context-free grammars, error recovery, layout-sensitive parsing, parenthesization and formatting, and syntactic completion. This paper gives a high level overview of SDF3 by means of examples and provides a guide to the literature for further details.

scholarly journals Implementasi Algoritma Dijkstra pada Aplikasi Go-Tahu dengan Pencarian Rute Terpendek ke Pabrik Tahu

2021 ◽  
Vol 5 (2) ◽  
pp. 103
Author(s):  
Putriana Mayang Sari ◽  
Fauziah Fauziah ◽  
Aris Gunaryati
Keyword(s):  
Total Weight ◽  
Search Process ◽  
Business Sector ◽  
Dijkstra’S Algorithm ◽  
Test Results ◽  
Dijkstra Algorithm ◽  
Dijkstra's Algorithm ◽  
Shortest Route ◽  
Shortest Distance ◽  
Route Search

Currently, the food business sector is increasing, one of which is tofu producers in South Tangerang. Many people who want to buy tofu of good quality but do not know the closest distance to the factory is located. In this research, we will use Dijkstra's Algorithm which is applied to the Android software to determine the shortest distance from one point to the tofu factory which is the chosen destination. Using the Dijkstra algorithm, an application will be designed, namely a mobile-based Go-Tofu for finding the closest route to the tofu factory. The route search process is carried out with a graph that has a weight and an area that is connected to a predetermined route. In the application test, it produces the shortest route from a house to the tofu factory with the smallest total weight of 11 kilometers based on the test results in the study.Keywords:Dijkstra’s Algorithm, Android, Flutter, Shortest Line, Tofu Factory.

scholarly journals Olympic Ceremony and Diplomacy: South Korean, North Korean, and British Media Coverage of the 2018 Olympic Winter Games’ Opening and Closing Ceremonies

2019 ◽  
pp. 216747951988654
Author(s):  
Jung Woo Lee
Keyword(s):  
Cultural Heritage ◽  
Media Coverage ◽  
Cultural Diplomacy ◽  
Newspaper Coverage ◽  
Winter Olympics ◽  
South Korean ◽  
Korean Identity ◽  
The Media ◽  
High Level ◽  
Opening And Closing

In this article, I examined South Korean, North Korean, and British newspaper coverage of the opening and closing ceremonies of the 2018 Winter Olympics in order to identify the diplomatic gestures and conduct presented during these ceremonial events. This study looks at three diplomatically important components of the opening and closing ceremonies: artistic performance, a parade of nations, and the presence of world leaders. The media coverage of these components reveals that (1) the dissemination of a message of peace and unity, (2) the representation of unified Korean identity and Korean cultural heritage, and (3) the communication and negotiation between the high-level state officials are the three most visible acts of diplomacy at these celebrational occasions of the 2018 PyeongChang Winter Olympics. In effect, the combination of cultural diplomacy, sport diplomacy, and interstate diplomacy is actively at work during these ritualistic events. Therefore, the Olympic ceremonies present a global podium where dynamic and dramatic games of diplomacy take place.

Svenska nominalfraser och kontext-fri grammatik

1984 ◽  
Vol 7 (2) ◽  
pp. 115-143 ◽  
Author(s):  
Robin Cooper
Keyword(s):  
Recent Work ◽  
Syntactic Structure ◽  
Phrase Structure ◽  
Noun Phrases ◽  
Morphological Features ◽  
Phrase Structure Grammar ◽  
Context Free

Swedish noun-phrases of the form (Det) (Adj)* N are examined in the light of recent work in generalized phrase-structure grammar. It is argued that simple generalizations about the phrase-structure of these NPs are lost by trying to account for the precise morphological possibilities by using phrase-structure rules mentioning categories marked with morphological features. What could be accounted for by two rules must be broken down into subcases which need seven rules, thereby obscuring the overall syntactic structure of the NPs. An alternative is suggested which maintains the simple syntax which generates morphologically ill-formed NPs but only allows morphologically well-formed ones to be interpreted. It is suggested that this system can be constrained so as to generate only context-free languages.

Representations reclaimed

2010 ◽  
Vol 18 (2) ◽  
pp. 273-312 ◽  
Author(s):  
Joel Parthemore ◽  
Anthony F. Morse
Keyword(s):  
Mental Content ◽  
The Other ◽  
Conceptual Spaces ◽  
Low Level ◽  
Context Sensitive ◽  
High Level ◽  
The Relationship ◽  
Context Free ◽  
Content Of Experience

Understanding the relationship between concepts and experience seems necessary to specifying the content of experience, yet current theories of concepts do not seem up to the job. With Peter Gärdenfors’s conceptual spaces theory as a foundation and with enactivist philosophy as inspiration, we present a proposed extension to conceptual spaces theory and use it to outline a model of the emergence of concepts and experience. We conclude that neither is ultimately primary but each gives rise to the other: i.e., that they co-emerge. Such a model can then serve as the anchor to a theory of concepts more generally. Concepts are most naturally understood in symbolic and representational terms, while much of experience, in contrast, is non-symbolic and non-representational; yet the conflict between the two will, herein, be shown to be more apparent than real. The main contribution of this paper is to argue for, by means of this account of co-emergence, a continuum between “low-level” mental content that is more appropriately understood in highly context-sensitive and directly sensorimotor-based terms, and “high-level” mental content that is more appropriately understood in context-free and representational or symbolic terms. In doing so we conclude that the extreme positions of representationalism and anti-representationalism are fatally flawed.

scholarly journals From UBGs to CFGs A practical corpus-driven approach

2007 ◽  
Vol 13 (4) ◽  
pp. 317-351
Author(s):  
HANS-ULRICH KRIEGER
Keyword(s):  
Approximation Method ◽  
Large Scale ◽  
Question Answering ◽  
Syntactic Structure ◽  
Language Models ◽  
Open Approach ◽  
Domain Specific ◽  
Stochastic Parsing ◽  
Speech Recognizer ◽  
Context Free

AbstractWe present a simple and intuitive unsound corpus-driven approximation method for turning unification-based grammars, such as HPSG, CLE, or PATR-II into context-free grammars (CFGs). Our research is motivated by the idea that we can exploit (large-scale), hand-written unification grammars not only for the purpose of describing natural language and obtaining a syntactic structure (and perhaps a semantic form), but also to address several other very practical topics. Firstly, to speed up deep parsing by having a cheap recognition pre-flter (the approximated CFG). Secondly, to obtain an indirect stochastic parsing model for the unification grammar through a trained PCFG, obtained from the approximated CFG. This gives us an efficient disambiguation model for the unification-based grammar. Thirdly, to generate domain-specific subgrammars for application areas such as information extraction or question answering. And finally, to compile context-free language models which assist the acoustic model of a speech recognizer. The approximation method is unsound in that it does not generate a CFG whose language is a true superset of the language accepted by the original unification-based grammar. It is a corpus-driven method in that it relies on a corpus of parsed sentences and generates broader CFGs when given more input samples. Our open approach can be fine-tuned in different directions, allowing us to monotonically come close to the original parse trees by shifting more information into the context-free symbols. The approach has been fully implemented in JAVA.

Comparison of stiffness and interface pressure during rest and exercise among various arm sleeves

2010 ◽  
Vol 25 (4) ◽  
pp. 196-200 ◽  
Author(s):  
M Hirai ◽  
K Niimi ◽  
H Iwata ◽  
I Sugimoto ◽  
H Ishibashi ◽  
...  
Keyword(s):  
Pressure Difference ◽  
Pressure Transducer ◽  
Pressure Amplitude ◽  
Interface Pressure ◽  
Maximal Opening ◽  
High Level ◽  
Opening And Closing ◽  
Contraction And Relaxation ◽  
Rest And Exercise

Objectives To compare the interface pressure during rest and exercise among various kinds of arm sleeves. Methods The interface pressure underneath nine different arm sleeves was measured during 10 maximal opening and closing movements of fingers using a pressure transducer (Air Pack Type Analyser) in 16 healthy volunteers. Furthermore, in order to evaluate the characteristics of each arm sleeve, the extensibility, stiffness and thickness were determined in vitro by several apparatuses. Results There was a significant correlation between stiffness and extensibility. The stiffness was significantly correlated with the pressure difference between muscle contraction and relaxation during exercise. The higher the value of stiffness, the greater the pressure amplitude during exercise. Conclusion Short-stretch arm sleeves characterized with a high level stiffness, including thick round- and flat-knitted arm sleeves, are more beneficial for the augmentation of muscle pumping than long-stretch arm sleeves, in the same way as short-stretch bandages or stockings applied to the leg.

scholarly journals Pengembangan Aplikasi Kunci Elektronik Brankas Berbasis Android dengan Mikrokontroler Berbasis Bluetooth

2020 ◽  
Vol 4 (3) ◽  
pp. 693
Author(s):  
Ilham Fahrul Rozi ◽  
Dolly Virgian Shaka Yudha Sakti ◽  
Safitri Juanita ◽  
Muhammad Anif
Keyword(s):  
System Development ◽  
Security System ◽  
Android Application ◽  
Simulation Tools ◽  
Java Programming ◽  
High Security ◽  
Development Life Cycle ◽  
Android Applications ◽  
High Level ◽  
Opening And Closing

Safety deposit box areusually used to protect valuables stuff from fire and theft using analog or digital keys or a combination of both. This research makes android based electronic lock application for safety deposit box to automate safe opening and closing keys with the help of a microcontroller using Bluetooth. The Workflow of these application is an Android application will activate Bluetooth on the cell phone and send input to the arduino network microcontroller to activate the Solenoid door lock so that it can open or lock safely. The purpose of this research is to design and build an Android application for electronic keys in a safety deposit box so that it has a high level of security and has a history (log) feature to find out the user's application activities. The system development life cycle that will be used to build this application is the Waterfall method. This application will be built using Java programming language with the Basic4Android editor, the database is stored using SQLite. The conclusion of this research is that after testing concluded that the integration of network microcontrollers such as Solenoid door locks, ATmega 328, Bluetooth HC-05 and testing Android applications as electronic keys into the application security system in safety deposit box has high security, simulation tools in safety deposit box can respond which is good for users when performing commands from Android via Bluetooth in less than 5 meters, the security system has high security because it has an authentication and LOG feature to find out the user's last activity (in and out)

scholarly journals MENENTUKAN RUTE TERPENDEK DENGAN MENGGUNAKAN ALGORITMA FLOYD-WARSHALL DALAM PENDISTRIBUSIAN BARANG PADA PT. RAPY RAY PUTRATAMA

2018 ◽  
Vol 4 (1) ◽  
Author(s):  
M Ridwan Mukti ◽  
Mulyono . .
Keyword(s):  
Shortest Path ◽  
Minimum Distance ◽  
Shortest Path Problem ◽  
Search Result ◽  
Shortest Route ◽  
Shortest Distance ◽  
Path Search ◽  
Distance Data ◽  
Shortest Path Search ◽  
Route Search

ABSTRAKMasalah pendistribusian pada perusahaan adalah masalah yang sangat penting untuk diperhatikan. Pada dasarnya pendistribusian barang akan sangat menghemat perusahaan dalam berbagai hal.Pencarian rute terpendek yang dilakukan pada PT. Rapy Ray Putratama Medan dilakukan dengan menghubungkan berbagai macem outlet dan juga termasuk beberapa outletnya adalah PT. Rapy Ray Putratama cabang medan. Permasalah rute terpendek ini dapat disesaikan dengan menggunakan salah satu metode pencarian rute terpendek yaitu algoritma Floyd-Warshall. Penelitian ini bertujuan untuk mengetahui hasil dari rute yang akan dipilih sebagai saran atau masukan kepada Perusahaan. Untuk hasil pencarian rute terpendek dengan menggunakan algoritma Floyd-Warshallyang diimplementasikan dalam pemrograman Codeblocks:: adalah jarak dari PT ke outlet maupun dari outlet ke outlet memiliki jarak yang paling minimum. Setelah itu, dapat ditentukan rute terpendek yang akan dipilih oleh salesman dalam pendistribusian yang telah didapatkan pada program tersebut. Data yang diinput adalah data jarak. Output yang dihasilkan program adalah jarak terpendek. Dengan penghematan jarak yang telah dilakukan. Pembentukan rute usulan yang dihasilkan dengan menggunakan metode algoritma Floyd-Warshall menghasilkan rute yang lebih dekat dengan total jarak penghematan adalah 10.97 % (51.304 km).Kata kunci: Pendistribusian, Pencarian rute terpendek, algoritma Floyd-Warshall. ABSTRACTThe problem of distribution to the company is a very important issue to notice. Basically the distribution of goods will greatly save the company expense in various ways. The searching for the shortest route done at PT. Rapy Ray Putratama Medan conducted by connecting various kinds of outlets and also including some outlets at PT. Rapy Ray Putratama Medan branch. This shortest path problem can be solved by using one of the shortest path search methods the Floyd-Warshall algorithm. This study aims to determine the results of the route to be selected as advice or input to the company. For the shortest route search result using Floyd-Warshall algorithm implemented in codeblocks programming is the distance from PT. Rapy Ray Putratamata outlet and from outlet to outlet which has the minimum distance. Subsequently, it can be determined the shortest route that will be selected by the salesman in the distribution that has been attained on the program. The inputted data is the distance data. The output produced by the program is the shortest distance by saving the distance that has been done through the algorithm. The proposed route formatted using the Floyd-Warshall algorithm method resulted in a route closer to the total distance of a saving distance of 10.97% (51,304 km). Keywords: Distribution, the shortest path searching, Floyd-Warshall algorithm.

scholarly journals Suicidal risk and characteristics of text written by patients with endogenous mental disorders

2020 ◽  
Vol LII (1) ◽  
pp. 97-100
Author(s):  
Tatiana I. Medvedeva ◽  
Sergey N. Enikolopov ◽  
Oksana Yu. Vorontsova
Keyword(s):  
Suicide Risk ◽  
Syntactic Structure ◽  
Personal Characteristics ◽  
Game Problem ◽  
Situational Analysis ◽  
Personality Questionnaire ◽  
Suicidal Risk ◽  
Mental Diseases ◽  
High Level ◽  
The Relationship

Aim. Identification of the relationship between suicidal risk and features of the text written by patients with endogenous mental diseases. Methods. The study involved 58 people-patients with endogenous mental diseases who were being treated at the MHRC clinic. All patients were asked to write an essay on the topic I, others, the world. To analyze the semantic and syntactic structure of utterances, the method of relational-situational analysis and the method of frequency lexical analysis using the PLATIn analyzer were used. All patients completed the following methods: (1) SCL-90-R symptomatic questionnaire (Symptom Check List-90-Revised); (2) the Iowa game problem the expectation-result model of Expectancy-valence is used, which introduces parameters for probabilistic modeling of decision-making: attention to win-loss, learning-forgetting, impulsivitydeterminism; (3) The Barratt impulsivity scale [10]; (4) the five-factor personality questionnaire, the BassPerry questionnaire. Results. The results of the Spearman correlation analysis showed statistically significant correlations between the severity of suicide risk (from the SCL-90 questionnaire) and the parameters of texts obtained using computer analysis, with the parameters of the Expectation-valence model of the Iowa game problem, the Barratt impulsivity scale, the BassPerry questionnaire, and emotionality in the five-factor personality questionnaire. Conclusions. There were found the features of the text that are associated with increased suicide risk: increased use of past tense verbs in texts; higher productivity increase in the number of sentences and words in the text while reducing the length of the words and decrease of the number of infinitives; the increase in the coefficient of Trager; reduced vocabulary positive rational assessment and mental activities; increase vocabulary of asthenic negative emotions. The analysis of the relationship between suicidal risk and personal characteristics revealed characteristics similar to those shown in the texts: a high level of hostility, increased emotionality, increased impulsivity and a pronounced momentary effect.

Sign in / Sign up

Export Citation Format

Share Document