Results 51 to 60 of about 150,917 (209)
Lay-it-out: Interactive Design of Layout-Sensitive Grammars [PDF]
Layout-sensitive grammars have been adopted in many modern programming languages. However, tool support for this kind of grammars still remains limited and immature. In this paper, we present Lay-it-out, an interactive framework for layout-sensitive grammar design.
arxiv
ABSTRACT This work presents the pioneering development of an aptamer‐based electrochemical biosensor for real‐time monitoring of parathyroid hormone (PTH) levels, with a focus on intraoperative assessment during parathyroid surgery. It introduces, for the first time, the selection and characterization of aptamers targeting distinct segments of the PTH ...
Reza Didarian+5 more
wiley +1 more source
Van Wijngaarden grammars, metamorphism and K-ary malwares [PDF]
Grammars are used to describe sentences structure, thanks to some sets of rules, which depends on the grammar type. A classification of grammars has been made by Noam Chomsky, which led to four well-known types. Yet, there are other types of grammars, which do not exactly fit in Chomsky's classification, such as the two-level grammars.
arxiv
Learning of Structurally Unambiguous Probabilistic Grammars [PDF]
The problem of identifying a probabilistic context free grammar has two aspects: the first is determining the grammar's topology (the rules of the grammar) and the second is estimating probabilistic weights for each rule. Given the hardness results for learning context-free grammars in general, and probabilistic grammars in particular, most of the ...
arxiv
Patterns in syntactic dependency networks [PDF]
Many languages are spoken on Earth. Despite their diversity, many robust language universals are known to exist. All languages share syntax, i.e., the ability of combining words for forming sentences. The origin of such traits is an issue of open debate.
Ferrer Cancho, Ramon+2 more
core +2 more sources
Restricted Global Grammar Constraints [PDF]
We investigate the global GRAMMAR constraint over restricted classes of context free grammars like deterministic and unambiguous context-free grammars. We show that detecting disentailment for the GRAMMAR constraint in these cases is as hard as parsing an unrestricted context free grammar.We also consider the class of linear grammars and give a ...
arxiv
Context-Free Grammars with Storage [PDF]
Context-free S grammars are introduced, for arbitrary (storage) type S, as a uniform framework for recursion-based grammars, automata, and transducers, viewed as programs. To each occurrence of a nonterminal of a context-free S grammar an object of type S is associated, that can be acted upon by tests and operations, as indicated in the rules of the ...
arxiv
Describing the syntax of programming languages using conjunctive and Boolean grammars [PDF]
A classical result by Floyd ("On the non-existence of a phrase structure grammar for ALGOL 60", 1962) states that the complete syntax of any sensible programming language cannot be described by the ordinary kind of formal grammars (Chomsky's ``context-free'').
arxiv
Coached habitus: Mapping the role of shadow education in shaping students' educational trajectories
Abstract Studies have shown how family (typically parents) and formal institutions (specifically schools and universities) shape individuals' dispositions—or habitus. However, other sites of academic socialisation, such as tutoring centres and coaching institutions (collectively forming a shadow education system), are seldom scrutinised for their role ...
Achala Gupta
wiley +1 more source
A generalized parsing framework for Abstract Grammars [PDF]
This technical report presents a general framework for parsing a variety of grammar formalisms. We develop a grammar formalism, called an Abstract Grammar, which is general enough to represent grammars at many levels of the hierarchy, including Context Free Grammars, Minimalist Grammars, and Generalized Context-free Grammars.
arxiv