نتایج جستجو برای: bottom up model

تعداد نتایج: 2908731  

1994
Gregor Erbach

We propose a bottom-up variant of Earley deduction. Bottom-up deduction is preferable to top-down deduction because it allows incrementai processing (even for head-driven grammars), it is data-driven, no subsumption check is needed, and preference values attached to lexical items can be used to guide best-first search. We discuss the scanning step for bottom-up Earley deduction and indexing sch...

2017
Paola Quaglia

These short notes provide descriptions and references relative to the construction of parsing tables for SLR(1), for LR(1), and for LALR(1) grammars. 1 Notation and basic definitions Basic definitions and notational conventions are summerized below. A context-free grammar is a tuple G = (V, T, S,P), where the elements of the tuple represent, respectively, the vocabulary of terminal and nontermi...

2007
Monika Büscher Michael Christensen Klaus Marius Hansen Preben Mogensen Dan Shapiro

Journal: :Nature Nanotechnology 2006

Journal: :Eos, Transactions American Geophysical Union 2004

Journal: :Journal of Logic, Language and Information 2021

Abstract The paper introduces a new type of rules into Natural Deduction, elimination by composition. Elimination composition replace usual in the style disjunction and give more direct treatment additive disjunction, multiplicative conjunction, existence quantifier possibility modality. have an enormous impact on proof-structures deductions: they do not produce segments, deduction trees remain...

Journal: :Sci. Comput. Program. 1989
Kees Hemerik Joost-Pieter Katoen

This paper deals with the formal derivation of an eecient tabulation algorithm for table-driven bottom-up tree acceptors. Bottom-up tree acceptors are based on a notion of match sets. First we derive a naive acceptance algorithm using dynamic computation of match sets. Tabulation of match sets leads to an eecient acceptance algorithm, but tables may be so large that they can not be generated du...

2000
S. Hoarau F. Mesnard U. Neumerkel

We present cTI, a system for bottom-up termination inference. Termination inference is a generalization of termination analy-sis/checking. Traditionally, a termination analyzer tries to prove that a given class of queries terminates. This class must be provided to the system, requiring user annotations. With termination inference such annotations are not necessary. Instead, all provably termina...

2009
Manfred Wuttig Ichiro Takeuchi

Title of Document: BOTTOM-UP MULTIFERROIC NANOSTRUCTURES. Shenqiang Ren, Doctor of Philosophy, 2009 Directed By: Professor Manfred Wuttig Department of Materials Science and Engineering Multiferroic and especially magnetoelectric (ME) nanocomposites have received extensive attention due to their potential applications in spintronics, information storage and logic devices. The extrinsic ME coupl...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید