Parse Tree Research Articles

On some innovations in teaching the formal semantics using software tools

Abstract In this work we discuss the motivation for innovations and need of a teaching tool for the visualization of the natural semantics method of imperative programming languages. We present the rôle of the teaching software, its design, development and use in the teaching process. Our software module is able to visualize the natural semantics evaluation of programs. It serves as a compiler with environment that can visually interpret simple programming language Jane statements and to depict them into a derivation tree that represents the semantic method of natural semantics. A formal definition of programming language Jane used in the teaching of formal semantics and production rules in natural semantics for that language are shown as well. We present, how the presented teaching tool can provide particular visual steps in the process of finding the meaning of well-structured input program and to depict complete natural-semantic representation of an input program.

FRASA PREPOSISIONAL DALAM KUMPULAN CERPEN 'SENJA DAN CINTA YANG BERDARAH' KARYA SENO GUMIRA AJIDARMA

This study aimed to determine the functional structure of sentences containing prepositional phrases and categorical patterns of prepositional phrase fillers in the short story Senja dan Cinta yang Berdarah written by Seno Gumira Adjidarma. The focus of this research is the prepositional phrase markers. This research is a descriptive qualitative research. Data collection was carried out by the listening method followed by the advanced note-taking technique. The data analysis technique used is the distribution technique with the basic technique for Direct Elements (BUL). The results of this study indicate that the functional structure of sentences found 25 patterns. Based on the categorical pattern of prepositional phrase fillers in, to, and from the found 11 patterns. The use of prepositional phrases in the short stories serves to state the setting or place of existence and the media. The prepositional phrase to serves to express the setting or destination. Then the prepositional phrase of the function is to state the setting or place of origin.

Coalgebraic Semantics for Probabilistic Logic Programming

Probabilistic logic programming is increasingly important in artificial intelligence and related fields as a formalism to reason about uncertainty. It generalises logic programming with the possibility of annotating clauses with probabilities. This paper proposes a coalgebraic semantics on probabilistic logic programming. Programs are modelled as coalgebras for a certain functor F, and two semantics are given in terms of cofree coalgebras. First, the F-coalgebra yields a semantics in terms of derivation trees. Second, by embedding F into another type G, as cofree G-coalgebra we obtain a `possible worlds' interpretation of programs, from which one may recover the usual distribution semantics of probabilistic logic programming. Furthermore, we show that a similar approach can be used to provide a coalgebraic semantics to weighted logic programming.

On Interactive Proof-Search for Constructive Modal Necessity

We present a dual sequent calculus for the necessity fragment of the constructive modal logic S4 and show its adequacy for proof-search in the style of modern interactive theorem provers. The main feature of dual systems is the use of two contexts to capture the notions of true and valid formulas, without using any formal semantics. This attribute allows us to give simple rules for the □ operator that, most of the time, grant the substitution of a strict modal reasoning by a pure propositional one, thus simplifying the proof-search process. Moreover, we introduce a formal notion of backward proof corresponding to a bottom-up construction of a derivation tree by means of a left-to-right depth-first proof-search.

Against the Low Periphery as Phrase Markers: Two Types of Contrastive Dislocations in Mandarin Chinese*

AbstractWe argue that the contrastive dislocation to the low peripheral position in Mandarin Chinese does not target phrase markers, like TopicP or FocusP, contra recent proposals that attempt to extend the cartographic theory to the low IP‐area. We argue that such dislocations are best analyzed as PF movements, which display the total reconstruction effect and do not affect the LF interface. We show that the contrastive dislocation to the low periphery in Mandarin Chinese is subject to the same PF licensing condition found in the Object Shift construction in Scandinavian. Our analysis thus claims that the low periphery is not a part of the narrow syntax (unlike the left periphery). The templatic nature of the low periphery explains why it is more restricted across languages and is prone to linguistic variation.

MedPath: A process-based modeling language for designing care pathways

ContextMedical professionals and hospitals promote solutions like care pathways and Health Information Systems (HIS) to support medical conduct and improve the quality of medical care. PurposeThis study proposes MedPath: a Domain Specific Language (DSL) for modeling care pathways based on the paradigms of Model-Based Engineering (MBE) that can be integrated into software solutions. ProceduresWe have developed MedPath's abstract syntax with the Eclipse Modeling Framework by employing Ecore technology and concrete syntax with the Eclipse Sirius. FindingsWe have modeled over 85 care pathways that are in use in 45 hospitals in Brazil. MedPath-originated pathways have been used over 3.2 million times since October 2017. We conducted a survey among the professionals who used MedPath to evaluate user satisfaction. ConclusionsWe believe MedPath can translate any care pathway into an action flow with its current abstractions. MedPath makes care pathways more easily integrated into HIS and electronic patient records, as it enables programmatic modeling and generates consumable artifacts.

Tunnel Parsing with counted repetitions

The article describes a new and efficient algorithm for parsing, called Tunnel Parsing, that parses from left to right on the basis of a context-free grammar without left recursion and rules that recognize empty words. The algorithm is applicable mostly for domain-specific languages. In the article, particular attention is paid to the parsing of grammar element repetitions. As a result of the parsing, a statically typed concrete syntax tree is built from top to bottom, that accurately reflects the grammar. The parsing is not done through a recursion, but through an iteration. The Tunnel Parsing algorithm uses the grammars directly without a prior refactoring and is with a linear time complexity for deterministic context-free grammars.

Complex mode-locking oscillations and Stern-Brocot derivation tree in a CSTR reaction with impulsive perturbations.

A complex mode-locking (entrainment) topology underlying the continuous stirred tank reactor reaction model subjected to impulsive perturbations is identified. Employing high-resolution stability diagrams, we exhibit the global structure of mode-locking oscillations and describe how they are interconnected and how their complexity unfolds with control parameters varying. The scenarios shown in the bi-parametric planes revealed that the skeleton of Arnold's tongues is organized according to the symmetric Stern-Brocot sum tree. Moreover, the mode-locking organization is controlled by an invariant torus (a pair of frequencies) initiated from Hopf bifurcations. Interestingly, the mode-locking order is unfolded in an elusive way, that is, in perfect agreement with the reciprocal of the Stern-Brocot sum tree. The findings reported here contribute to providing a description and classification of mode-locking oscillations for the impulsive system.

Domain-Specific Language Techniques for Visual Computing: A Comprehensive Study

As a part of domain-specific development, Domain-Specific Language (DSL) is widely used in both the academia and industry to solve different aspects of the problems in engineering. A DSL is a customized language whose expressiveness is tailored to a well-defined application domain, so as to offer an effective interface for the domain experts. To mitigate the programming complexity of the General-Purpose Programming Languages, and meanwhile maintain the precise expression towards some exact engineering domains, DSLs present a higher level of abstraction than low-level interfaces, while providing much more flexibility than high-level interfaces. Nevertheless, it lacks a survey to have a systematic overview of the essential commonalities shared by those works. In this survey, we take a brand-new perspective, to categorize the state-of-the-art works into different categories, tailored to three fundamental implementation concerns of DSLs: abstract syntax, concrete syntax, and semantics. Specifically, they are characterized according to their parsing and mapping strategy (external/internal) between the abstract syntax and concrete syntax, the mapping results (textual/graphical symbols), and also the functions they emphasize (modeling, visualizing, etc.). Integrated with the literature, we finally summarized the research overview of DSLs.

CEViNEdit: improving the process of creating cognitively effective graphical editors with GMF

The rise of domain-specific (Visual) languages and the inherent complexity of developing graphical editors for these languages have led to the emergence of proposals that provide support for this task. Most of these proposals are principally based on EMF and GMF, which effectively help to simplify and increase the level of automation of the development process of the editors, but it is important to recall that these proposals have some important disadvantages, mainly related to the learning curve of these technologies, poor documentation or the complexity of providing all the customisation possibilities to the user. In addition, in the process of developing a domain-specific language, issues related to graphical conventions have historically been undervalued, while most of the effort has been focused on semantic aspects. In fact, definitions of the concrete (visual) syntax of modelling languages in Software Engineering are usually based on common sense, intuition, the reuse of existing notations or emulation of common practices. In order to alleviate the inherent complexity of the EMF/GMF approach for the development of graphical editors and to support the evaluation of the quality of visual notations of modelling languages, this article presents CEViNEdit, an intuitive tool that simultaneously supports the semi-automatic generation of graphical editors and the assessment of the cognitive effectiveness of the visual notation implemented by the editor.

Pragmatic reuse for DSML development

By bridging the semantic gap, domain-specific language (DSLs) serve an important role in the conquest to allow domain experts to model their systems themselves. In this publication we present a case study of the development of the Continuous REactive SysTems language (CREST), a DSL for hybrid systems modeling. The language focuses on the representation of continuous resource flows such as water, electricity, light or heat. Our methodology follows a very pragmatic approach, combining the syntactic and semantic principles of well-known modeling means such as hybrid automata, data-flow languages and architecture description languages into a coherent language. The borrowed aspects have been carefully combined and formalised in a well-defined operational semantics. The DSL provides two concrete syntaxes: CREST diagrams, a graphical language that is easily understandable and serves as a model basis, and crestdsl, an internal DSL implementation that supports rapid prototyping—both are geared towards usability and clarity. We present the DSL’s semantics, which thoroughly connect the various language concerns into an executable formalism that enables sound simulation and formal verification in crestdsl, and discuss the lessons learned throughout the project.

A System for Explainable Answer Set Programming

We present xclingo, a tool for generating explanations from ASP programs annotated with text and labels. These annotations allow tracing the application of rules or the atoms derived by them. The input of xclingo is a markup language written as ASP comment lines, so the programs annotated in this way can still be accepted by a standard ASP solver. xclingo translates the annotations into additional predicates and rules and uses the ASP solver clingo to obtain the extension of those auxiliary predicates. This information is used afterwards to construct derivation trees containing textual explanations. The language allows selecting which atoms to explain and, in its turn, which atoms or rules to include in those explanations. We illustrate the basic features through a diagnosis problem from the literature.

Enriching Knowledge Base by Parse Tree Pattern and Semantic Filter

This paper proposes a simple knowledge base enrichment based on parse tree patterns with a semantic filter. Parse tree patterns are superior to lexical patterns used commonly in many previous studies in that they can manage long distance dependencies among words. In addition, the proposed semantic filter, which is a combination of WordNet-based similarity and word embedding similarity, removes parse tree patterns that are semantically irrelevant to the meaning of a target relation. According to our experiments using the DBpedia ontology and Wikipedia corpus, the average accuracy of the top 100 parse tree patterns for ten relations is 68%, which is 16% higher than that of lexical patterns, and the average accuracy of the newly extracted triples is 60.1%. These results prove that the proposed method produces more relevant patterns for the relations of seed knowledge, and thus more accurate triples are generated by the patterns.

Automatic generation of Web of Things servients using Thing Descriptions

Similarly to the standardization effort initiated for the World Wide Web in the 1990s, the World Wide Web Consortium is currently working on the Web of Things (WoT) specification. This initiative aims to tackle current fragmentation in the so-called Internet of Things by using existing Web standards. The ultimate goal is to cope with the increasing number of devices that are being connected to the Internet and to enable interoperability among them. On the other hand, Model-Driven Engineering (MDE) approaches make use of models to raise the abstraction level with the objective of accelerating the software development process, enabling design and code reuse, and increasing software quality.This work proposes to apply MDE techniques to enable the efficient development of WoT servients. Based on the WoT Thing Description specification, this work proposes both a textual-based concrete syntax and a model-based abstract syntax—both fully compliant with the WoT specification—that enable the generation of WoT servients in C++ with CoAP communication capabilities. This proposal is implemented by a tool that covers the whole development process, which is publicly available under an open source license.

A Domain-Specific Modelling Language for Adventure Educational Games and Flow Theory

Designing educational games is a complex task and needs collaboration between game developers and an educator. Domain-Specific Modeling Language (DSML) offers an approach to simplify the design activities of educational games and support the involvement of both game developers and educators. This paper presents an extension of Serious Game Logic and Structure Modeling Language (GLiSMo), a DSML that designs the logical and structural views of educational adventure games. The gap in the original GLiSMo is that it did not allow an educational game to be designed according to any learning theories. Furthermore, the original GLiSMo does not cover all concepts in the adventure genre. The authors intend to extend the original GLiSMo by adding the concepts of Flow Theory and concepts of the adventure genre to make it more expressive. The extended DSML is called FA-GLiSMo. The authors evaluated the expressiveness of FA-GLiSMo using Framework for Qualitative Assessment of DSLs (FQAD). The result shows that the expressiveness of FA-GLiSMo is still ‘incomplete’ due to the lack of clarity of semantics for several domain concepts. Improvements were performed, and the finalized FA-GLiSMo now has fifteen (15) concepts of the Logic diagram, nineteen (19) concepts of the Structure diagram, and a new diagram called the Flow diagram containing five (5) concepts of the Flow Theory. The authors also demonstrate in this paper the concrete syntax of FA-GLiSMo using the Tales of Monkey Island game as a case study.

SQAL Self-Adaptive System's Quality Assurance Language

Today's software systems tend to be flexible and dynamic by provisioning mechanisms to react quickly to the environment changes and to adapt system configuration accordingly, in order to maintain the required quality of service (QoS). The engineering of system self-adaptation requires new modeling methods and development methodologies that employ the principles of model-driven development in building self-adaptive systems (SASs). To tackle this issue, the present work proposes SQAL (self-adaptive system quality assurance language) a domain specific language for quality-aware SASs. This language allows describing SASs architectural elements and the corresponding interrelations in terms of hierarchical compositions. It also provides concepts for defining SASs behavioral aspects by identifying adaptation actions and mainly weighting them with QoS parameters. SQAL is defined in terms of its abstract and concrete syntaxes. This article associates a PSMaude-based semantics to SQAL in order to quantitatively analyze quality-aware SASs behaviors.

DSML4CS

Cyber physical systems (CPS's) are a kind of complex system with highly integrated interaction between computing resources and physical environment in a network environment. There are some challenges in modeling and simulation of heterogeneous CPS due to its hybrid and heterogenous characteristics. To address the issue, we propose an executable domain specific modeling language for co-simulation (DSML4CS) to model the co-simulation of CPS. According to the construction method of domain modeling language, we present the abstract syntax, concrete syntax and operational semantics of DSML4CS. We also propose a flexible co-simulation mechanism, which supports partial step revision of specific co-simulation process with the state event fault-tolerant mechanism. The co-simulation language for heterogeneous CPS is implemented based on the GEMOC platform. Our aim is to provide the co-simulation service in CPS. The usability of DSML4CS is illustrated with a case study of a temperature control system in an energy-aware building.

SCRAPING WEB MARKETPLACE MENGGUNAKAN METODE DOM PARSING UNTUK PENGUMPULAN DATA PRODUK

Web Scraper is a way of extracting scripts that run there that are commonly chosen to do web memos via DOM parsing. Specific nodes that are collected using DOM parsers and tools like XPath help the process of scraping web pages. In this study using the DOM Parsing method to obtain product data on the market. Sraper can be further developed as a data collection technique on the internet for further research that can be provided about the concept of big data to be used for forecasting or getting the information needed. Alone Parsing is a way of breaking data or symbols, both in language and in language, according to formal grammar rules. After using the parshing technique, it will be generated again using Parse Tree, which is a process of compiling product data that forms like a tree, using siyntak analysis to break down product categories.

An executable modeling and analyzing approach to C4ISR architecture

To analyze the behavioral model of the command, control, communication, computer, intelligence, surveillance, reconnaissance (C4ISR) architecture, we propose an executable modeling and analyzing approach to it. First, the meta concept model of the C4ISR architecture is introduced. According to the meta concept model, we construct the executable meta models of the C4ISR architecture by extending the meta models of fUML. Then, we define the concrete syntax and executable activity algebra (EAA) semantics for executable models. The semantics functions are introduced to translating the syntax description of executable models into the item of EAA. To support the execution of models, we propose the executable rules which are the structural operational semantics of EAA. Finally, an area air defense of the C4ISR system is used to illustrate the feasibility of the approach.

The asymmetric behavior of English negative quantifiers in negative sentences

In this paper, the unexpected behavior of object negative quantifiers in some diagnostic tests of sentential negation is accounted for within a Minimalist framework assuming that: (i) negative quantifiers decompose into negation and an existential quantifier; (ii) negative quantifiers are multidominant phrase markers, as Parallel Merge allows the verb to c-select their existential part but not their negative part, thus giving negation remerge flexibility; (iii) tag questions involveor-coordination of TPs, andneither/soclauses involveand-coordination of TPs; (iv) two positions for sentential negation are available in English, one below TP (PolP2), and one above TP (PolP1). Activation of either PolP1or PolP2in the absence of other scope-taking operators corresponds to two distinct grammars. If PolP1is active, the negative part of an object negative quantifier remerges in its Specifier valuing the [upol: ] feature of Pol1as negative ([upol:neg]) while skipping the TP-domain. As no negative formal feature is present in the TP, a negative question tag is required, as well asso-coordination,too-licensing andYes, I guess so‘expression of agreement’. Conversely, if PolP2is active, the negative part of the object negative quantifier remerges in the TP-domain (in Spec, PolP2), thus requiring a positive question tag,neither-coordination,either-licensing, andNo, I guess not.