BibSLEIGH — grammar stem

Used together with:

graph (199)
attribut (147)
base (92)
context (89)
free (77)

Stem grammar$ (all stems)

730 papers:

DAC-2015-JassiMS #design #grammarware #integration #named: GRIP: grammar-based IP integration and packaging for acceleration-rich SoC designs (MJ, DMG, US), p. 6.
TACAS-2015-BransenBCD #attribute grammar #order #scheduling #using: Linearly Ordered Attribute Grammar Scheduling Using SAT-Solving (JB, LTvB, KC, AD), pp. 289–303.
SCAM-2015-AivaloglouHH #dataset #scalability #spreadsheet: A grammar for spreadsheet formulas evaluated on two large datasets (EA, DH, FH), pp. 121–130.
PEPM-2015-BinsbergenBD #attribute grammar #automation #dependence #order: Linearly Ordered Attribute Grammars: with Automatic Augmenting Dependency Selection (LTvB, JB, AD), pp. 49–60.
CIAA-2015-Prusa #context-free grammar #decidability #multi #problem: (Un)decidability of the Emptiness Problem for Multi-dimensional Context-Free Grammars (DP), pp. 250–262.
DLT-2015-Lohrey #grammarware: Grammar-Based Tree Compression (ML), pp. 46–57.
LATA-2015-Yoshinaka #boolean grammar #grammar inference #learning: Learning Conjunctive Grammars and Contextual Binary Feature Grammars (RY), pp. 623–635.
ICGT-2015-DrewesHM #parsing #predict #top-down: Predictive Top-Down Parsing for Hyperedge Replacement Grammars (FD, BH, MM), pp. 19–34.
ICGT-2015-LeblebiciAS #graph grammar #multi #tool support: Tool Support for Multi-amalgamated Triple Graph Grammars (EL, AA, AS), pp. 257–265.
ICGT-2015-LeblebiciAST #graph grammar #multi: Multi-amalgamated Triple Graph Grammars (EL, AA, AS, GT), pp. 87–103.
ECIR-2015-MarreroU #information management: Information Extraction Grammars (MM, JU), pp. 265–270.
MoDELS-J-2011-HermannEOCDXGE15 #correctness #graph grammar: Model synchronization based on triple graph grammars: correctness, completeness and invertibility (FH, HE, FO, KC, ZD, YX, SG, TE), pp. 241–269.
MoDELS-J-2011-HermannEOCDXGE15 #correctness #graph grammar: Model synchronization based on triple graph grammars: correctness, completeness and invertibility (FH, HE, FO, KC, ZD, YX, SG, TE), pp. 241–269.
BX-2015-AnjorinLKSS #approach #graph grammar #guidelines: A Systematic Approach and Guidelines to Developing a Triple Graph Grammar (AA, EL, RK, AS, PS), pp. 81–95.
OOPSLA-2015-MadhavanMGK #automation #comparison: Automating grammar comparison (RM, MM, SG, VK), pp. 183–200.
SLE-2015-Burger #attribute grammar #bibliography #graph grammar #motivation #perspective: Reference attribute grammar controlled graph rewriting: motivation and overview (CB), pp. 89–100.
SLE-2015-LaurentM #parsing expression grammar: Parsing expression grammars made practical (NL, KM), pp. 167–172.
CC-2015-PingaliB #context-free grammar #parsing #visual notation: A Graphical Model for Context-Free Grammar Parsing (KP, GB), pp. 3–27.
CSL-2015-HetzlZ: Tree Grammars for the Elimination of Non-prenex Cuts (SH, SZ), pp. 110–127.
TLCA-2015-AfshariHL #context-free grammar: Herbrand Disjunctions, Cut Elimination and Context-Free Tree Grammars (BA, SH, GEL), pp. 1–16.
FASE-2014-AnjorinSLS #graph grammar #refinement #using: Modularizing Triple Graph Grammars Using Rule Refinement (AA, KS, ML, AS), pp. 340–354.
PEPM-2014-BransenDS #attribute grammar #evaluation #incremental #lazy evaluation: Lazy stateless incremental evaluation machinery for attribute grammars (JB, AD, SDS), pp. 145–156.
PEPM-2014-MartinsSFW #attribute grammar #bidirectional #generative #grammarware: Generating attribute grammar-based bidirectional transformations from rewrite rules (PM, JS, JPF, EVW), pp. 63–70.
AFL-2014-BarashO: Grammars with two-sided contexts (MB, AO), pp. 94–108.
AFL-2014-FernauFH #distributed #finite #hybrid: Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes (HF, RF, MH), pp. 246–260.
DLT-2014-Sorokin #context-free grammar: Pumping Lemma and Ogden Lemma for Displacement Context-Free Grammars (AS), pp. 154–165.
ICALP-v2-2014-Jancar #bisimulation #equivalence #first-order: Bisimulation Equivalence of First-Order Grammars (PJ), pp. 232–243.
LATA-2014-DingSXHMC #modelling #probability: Stochastic k-Tree Grammar and Its Application in Biomolecular Structure Modeling (LD, AS, XX, XH, RLM, LC), pp. 308–322.
GT-VMT-2014-LeblebiciASHRG #comparison #graph grammar #incremental #tool support: A Comparison of Incremental Triple Graph Grammar Tools (EL, AA, AS, SH, JR, JG).
ICGT-2014-AnjorinLST #graph grammar #model transformation #performance #static analysis: A Static Analysis of Non-confluent Triple Graph Grammars for Efficient Model Transformation (AA, EL, AS, GT), pp. 130–145.
ICPR-2014-DengWGZZ #modelling #multi: Multiple View Based Building Modeling with Multi-box Grammar (RD, QW, RG, GZ, HZ), pp. 4027–4032.
KDIR-2014-Nakano #induction #string: Emergent Induction of L-system Grammar from a String with Deletion-type Transmutation (RN), pp. 397–402.
ECMFA-2014-AnjorinRDS #graph grammar #performance: Efficient Model Synchronization with View Triple Graph Grammars (AA, SR, FD, AS), pp. 1–17.
ICMT-2014-BlouinPDSD #case study #experience #graph grammar #modelling: Synchronization of Models of Rich Languages with Triple Graph Grammars: An Experience Report (DB, AP, PD, FS, JPD), pp. 106–121.
ICMT-2014-HermannGNEBMPEE #graph grammar #in the large: Triple Graph Grammars in the Large for Translating Satellite Procedures (FH, SG, NN, HE, BB, GM, AP, TE, CE), pp. 122–137.
ICMT-2014-OrejasP #correctness #graph grammar #incremental: Correctness of Incremental Model Synchronization with Triple Graph Grammars (FO, EP), pp. 74–90.
OOPSLA-2014-RendelBO #algebra #attribute grammar: From object algebras to attribute grammars (TR, JIB, KO), pp. 377–395.
LDTA-J-2011-JohnstoneSB #composition #grammarware #specification: Modular grammar specification (AJ, ES, MvdB), pp. 23–43.
LDTA-J-2011-SauthoffG #analysis #domain-specific language #optimisation #programming: Yield grammar analysis and product optimization in a domain-specific language for dynamic programming (GS, RG), pp. 2–22.
SLE-J-2012-KrishnanW #analysis #attribute grammar #composition #higher-order #termination: Monolithic and modular termination analyses for higher-order attribute grammars (LK, EVW), pp. 511–526.
SLE-J-2012-PaigeKP #grammarware #metamodelling #research #tutorial: A tutorial on metamodelling for grammar researchers (RFP, DSK, FACP), pp. 396–416.
SLE-J-2012-SloaneR #attribute grammar #domain-specific language #profiling #term rewriting: Domain-specific program profiling and its application to attribute grammars and term rewriting (AMS, MR), pp. 488–510.
SLE-J-2012-StormCL #design #implementation: The design and implementation of Object Grammars (TvdS, WRC, AL), pp. 460–487.
SLE-2014-Ridge #combinator #context-free grammar #parsing #performance #using: Simple, Efficient, Sound and Complete Combinator Parsing for All Context-Free Grammars, Using an Oracle (TR), pp. 261–281.
SLE-2014-WilliamsW #attribute grammar: Origin Tracking in Attribute Grammars (KW, EVW), pp. 282–301.
ICST-2014-KifetewJTOT #grammarware #source code: Reproducing Field Failures for Programs with Complex Grammar-Based Input (FMK, WJ, RT, AO, PT), pp. 163–172.
RTA-TLCA-2014-CreusG #automation #context-free grammar #evaluation: Automatic Evaluation of Context-Free Grammars (System Description) (CC, GG), pp. 139–148.
ASE-2013-KifetewJTOT #approach #grammarware #named #source code: SBFR: A search based approach for reproducing failures of programs with grammar based input (FMK, WJ, RT, AO, PT), pp. 604–609.
WCRE-2013-AvanciniC #grammarware #named #testing #web: Circe: A grammar-based oracle for testing Cross-site scripting in web applications (AA, MC), pp. 262–271.
CIAA-2013-BelliB #testing #using: Using Regular Grammars for Event-Based Testing (FB, MB), pp. 48–59.
CIAA-2013-HanKS #approximate #automaton #context-free grammar #finite: Approximate Matching between a Context-Free Grammar and a Finite-State Automaton (YSH, SKK, KS), pp. 146–157.
DLT-2013-JezO #ambiguity #boolean grammar: Unambiguous Conjunctive Grammars over a One-Letter Alphabet (AJ, AO), pp. 277–288.
ICALP-v2-2013-EtessamiSY #context-free grammar #probability #regular expression: Stochastic Context-Free Grammars, Regular Languages, and Newton’s Method (KE, AS, MY), pp. 199–211.
LATA-2013-NakamuraI #automaton #linear #stack: Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars (KN, KI), pp. 444–455.
LATA-2013-Shamir: Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars (ES), pp. 516–522.
CEFP-2013-Halupka #domain-specific language #refactoring: DSL for Grammar Refactoring Patterns (IH), pp. 446–458.
GCM-J-2012-Flick #graph grammar: Derivation Languages of Graph Grammars (NEF).
GCM-J-2012-SmolenovaKC #graph grammar #parallel #performance: Parallel Graph Grammars with Instantiation Rules Allow Efficient Structural Factorization of Virtual Vegetation (KS, WK, PHC).
GT-VMT-2013-ForsH #attribute grammar #editing #reuse #semantics #visual notation: Reusing Semantics in Visual Editors: A Case for Reference Attribute Grammars (NF, GH).
ICEIS-v1-2013-LaurierP #concept #representation: An Enterprise-ontology based Conceptual-modeling Grammar for Representing Value Chain and Supply Chain Scripts (WL, GP), pp. 103–111.
AMT-2013-Gottmann0NBEEE #concurrent #correctness #graph grammar: Correctness and Completeness of Generalised Concurrent Model Synchronisation Based on Triple Graph Grammars (SG, FH, NN, BB, CE, HE, TE), pp. 62–71.
BX-2013-HildebrandtLGRGSLAS #bibliography #graph grammar #tool support: A Survey of Triple Graph Grammar Tools (SH, LL, HG, JR, JG, WS, ML, AA, AS), pp. 1–17.
ICMT-2013-HermannGNBMPE #automation #graph grammar #on the #using: On an Automated Translation of Satellite Procedures Using Triple Graph Grammars (FH, SG, NN, BB, GM, AP, TE), pp. 50–51.
ICMT-2013-MannEF #framework #graph grammar #library #term rewriting: The Graph Grammar Library — A Generic Framework for Chemical Graph Rewrite Systems (MM, HE, CF), pp. 52–53.
SAC-2013-HorieS #difference: Extracting differences between regular tree grammars (KH, NS), pp. 859–864.
LDTA-J-2009-SloaneKV #attribute grammar: A pure embedding of attribute grammars (AMS, LCLK, EV), pp. 1752–1769.
SLE-2013-BatoryGMS #automation #design #graph grammar: Dark Knowledge and Graph Grammars in Automated Software Design (DSB, RG, BM, JS), pp. 1–18.
SLE-2013-SoderbergH #attribute grammar #higher-order: Circular Higher-Order Reference Attribute Grammars (ES, GH), pp. 302–321.
SLE-2013-VasudevanT #ambiguity #detection #programming language: Detecting Ambiguity in Programming Language Grammars (NV, LT), pp. 157–176.
SLE-2013-Zaytsev #grammarware: Micropatterns in Grammars (VZ), pp. 117–136.
PPoPP-2013-MeyerovichTAB #attribute grammar #parallel #synthesis: Parallel schedule synthesis for attribute grammars (LAM, MET, EA, RB), pp. 187–196.
ICTSS-2013-GuoQ #automation #generative #grammarware #testing: Automatic Grammar-Based Test Generation (HFG, ZQ), pp. 17–32.
CBSE-2012-KarolBA #attribute grammar #composition #towards: Towards well-formed fragment composition with reference attribute grammars (SK, CB, UA), pp. 109–114.
FASE-2012-HermannEEO #concurrent #graph grammar: Concurrent Model Synchronization with Conflict Resolution Based on Triple Graph Grammars (FH, HE, CE, FO), pp. 178–193.
STOC-2012-EtessamiSY #algorithm #branch #context-free grammar #multi #polynomial #probability #process: Polynomial time algorithms for multi-type branching processes and stochastic context-free grammars (KE, AS, MY), pp. 579–588.
DLT-2012-BuchseMV #semantics: Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars (MB, AM, HV), pp. 368–379.
DLT-2012-HolzerJM #context-free grammar: Generalized Derivations with Synchronized Context-Free Grammars (MH, SJ, IM), pp. 109–120.
DLT-2012-LavadoPS #automaton #context-free grammar #nondeterminism: Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata (GJL, GP, SS), pp. 284–295.
DLT-2012-Otto #component #on the: On Centralized PC Grammar Systems with Context-Sensitive Components (FO), pp. 356–367.
LATA-2012-BarashO #context-free grammar: Defining Contexts in Context-Free Grammars (MB, AO), pp. 106–118.
LATA-2012-GagieGKNP #grammarware #performance #self: A Faster Grammar-Based Self-index (TG, PG, JK, YN, SJP), pp. 240–251.
LATA-2012-Yoshinaka #context-free grammar #integration #learning: Integration of the Dual Approaches in the Distributional Learning of Context-Free Grammars (RY), pp. 538–550.
GT-VMT-2012-Heussner #communication #graph #graph grammar #model checking #process: Model Checking Communicating Processes: Run Graphs, Graph Grammars, and MSO (AH).
ICGT-2012-AnjorinST #graph grammar: Construction of Integrity Preserving Triple Graph Grammars (AA, AS, GT), pp. 356–370.
ICGT-2012-GolasLEG #flexibility #formal method #graph grammar #towards: Toward Bridging the Gap between Formal Foundations and Current Practice for Triple Graph Grammars — Flexible Relations between Source and Target Elements (UG, LL, HE, HG), pp. 141–155.
ICGT-2012-LauderAVS #graph grammar #performance #precedence: Efficient Model Synchronization with Precedence Triple Graph Grammars (ML, AA, GV, AS), pp. 401–415.
ICPR-2012-LeeKD #induction #learning: Learning action symbols for hierarchical grammar induction (KL, TKK, YD), pp. 3778–3782.
MLDM-2012-SapkotaBS #grammar inference #principle #using: Unsupervised Grammar Inference Using the Minimum Description Length Principle (US, BRB, APS), pp. 141–153.
AMT-2012-HildebrandtLG #development #framework #graph grammar #model transformation: The MDELab tool framework for the development of correct model transformations with triple graph grammars (SH, LL, HG), pp. 33–34.
BX-2012-LambersHGO #bidirectional #graph grammar #model transformation: Attribute Handling for Bidirectional Model Transformations: The Triple Graph Grammar Case (LL, SH, HG, FO), pp. 84–99.
ECMFA-2012-LauderAVS #bidirectional #graph grammar #model transformation #precedence: Bidirectional Model Transformation with Precedence Triple Graph Grammars (ML, AA, GV, AS), pp. 287–302.
LOPSTR-2012-Niwa0S #source code: Improving Determinization of Grammar Programs for Program Inversion (MN, NN, MS), pp. 155–175.
PADL-2012-BransenMDS #algorithm #attribute grammar: The Kennedy-Warren Algorithm Revisited: Ordering Attribute Grammars (JB, AM, AD, SDS), pp. 183–197.
LDTA-2012-VieraSD: Grammar fragments fly first-class (MV, SDS, AD), p. 5.
LDTA-2012-VieraSM #attribute grammar #how: UUAG meets AspectAG: how to make attribute grammars first-class (MV, SDS, AM), p. 6.
LDTA-2012-Zaytsev #grammar recovery #parametricity: Notation-parametric grammar recovery (VZ), p. 9.
SLE-2012-AfroozehBBJMMS #gll #grammarware #semiparsing #using: Island Grammar-Based Parsing Using GLL and Tom (AA, JCB, MvdB, AJ, MM, PEM, ES), pp. 224–243.
SLE-2012-BarenghiVCMP #generative #named #parallel #parsing #precedence: PAPAGENO: A Parallel Parser Generator for Operator Precedence Grammars (AB, EV, SCR, DM, MP), pp. 264–274.
SLE-2012-KaminskiW #analysis #attribute grammar #composition: Modular Well-Definedness Analysis for Attribute Grammars (TK, EVW), pp. 352–371.
SLE-2012-KrishnanW #analysis #attribute grammar #higher-order #termination: Termination Analysis for Higher-Order Attribute Grammars (LK, EVW), pp. 44–63.
SLE-2012-Sloane #abstraction #analysis #attribute grammar #evaluation: Profile-Based Abstraction and Analysis of Attribute Grammar Evaluation (AMS), pp. 24–43.
SLE-2012-StormCL: Object Grammars (TvdS, WRC, AL), pp. 4–23.
ICST-2012-EnderlinDGB #grammarware #php #testing #using: Grammar-Based Testing Using Realistic Domains in PHP (IE, FD, AG, FB), pp. 509–518.
ICST-2012-SaleckerG #combinator #grammarware #interactive #testing: Combinatorial Interaction Testing for Test Selection in Grammar-Based Testing (ES, SG), pp. 610–619.
LICS-2012-Jancar #decidability #equivalence #first-order: Decidability of DPDA Language Equivalence via First-Order Grammars (PJ), pp. 415–424.
ICDAR-2011-AlvaroSB #2d #context-free grammar #probability #recognition #using: Recognition of Printed Mathematical Expressions Using Two-Dimensional Stochastic Context-Free Grammars (FA, JAS, JMB), pp. 1225–1229.
ICDAR-2011-CelikY #2d #graph grammar #probability #recognition #using: Probabilistic Mathematical Formula Recognition Using a 2D Context-Free Graph Grammar (MC, BAY), pp. 161–166.
SCAM-J-2009-LammelZ11 #grammar recovery #java #specification: Recovering grammar relationships for the Java Language Specification (RL, VZ), pp. 333–378.
DLT-J-2009-Zetzsche11 #capacity #comprehension #generative #matrix #towards: Toward Understanding the Generative Capacity of Erasing Rules in Matrix Grammars (GZ), pp. 411–426.
AFL-2011-EnguixGJ: Grammar Systems as Orchestras of Grammatical Services (GBE, MAG, MDJL), pp. 65–78.
AFL-2011-IvanM #context-free grammar #generative #word: Müller context-free grammars generating well-ordered words (SI, ÁM), pp. 225–240.
AFL-2011-MedunaVZ #nondeterminism #on the: On Nondeterminism in Programmed Grammars (AM, LV, PZ), pp. 315–327.
CIAA-2011-BechetDF #strict: Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages (DB, AJD, AF), pp. 42–52.
DLT-2011-Yoshinaka #concept #context-free grammar #learning #towards: Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept Lattices (RY), pp. 429–440.
ICALP-v2-2011-Zetzsche #automaton #monad #on the #transducer: On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids (GZ), pp. 222–233.
LATA-2011-BrijderB: Characterizing Compressibility of Disjoint Subgraphs with NLC Grammars (RB, HB), pp. 167–178.
LATA-2011-JansenHKN #normalisation: A Local Greibach Normal Form for Hyperedge Replacement Grammars (CJ, JH, JPK, TN), pp. 323–335.
LATA-2011-Marciniec: Tarski’s Principle, Categorial Grammars and Learnability (JM), pp. 378–389.
GCM-2010-GolasEH11 #graph grammar #model transformation #specification: Formal Specification of Model Transformations by Triple Graph Grammars with Application Conditions (UG, HE, FH).
GCM-2010-HoffmannM11 #adaptation #diagrams #generative #graph: Generating Instance Graphs from Class Diagrams with Adaptive Star Grammars (BH, MM).
AGTIVE-2011-FurstMM #graph grammar #heuristic #induction #process: Graph Grammar Induction as a Parser-Controlled Heuristic Search Process (LF, MM, VM), pp. 121–136.
AGTIVE-2011-HildebrandtLGPR #automation #consistency #graph grammar #implementation #testing: Automatic Conformance Testing of Optimized Triple Graph Grammar Implementations (SH, LL, HG, DP, IR), pp. 238–253.
GT-VMT-2011-EhrigHSB #constraints #graph grammar #model transformation: Propagation of Constraints along Model Transformations Based on Triple Graph Grammars (HE, FH, HS, CB).
HCI-ITE-2011-ZhangAR #human-computer #interactive #multi: Developing and Exploiting a Multilingual Grammar for Human-Computer Interaction (XZ, RA, DFR), pp. 396–405.
ICML-2011-Clark: Inference of Inversion Transduction Grammars (AC), pp. 201–208.
SEKE-2011-RoudakiK #grammarware #graph grammar #web: Graph Grammar Based Web Data Extraction (AR, JK), pp. 373–378.
BX-2011-Brandt #enterprise #graph grammar #modelling #on the #requirements: On the role of Triple Graph Grammars Concerning Requirements for Enterprise Modeling (CB), p. 54.
BX-2011-Kindler #concept #graph grammar #implementation: Triple Graph Grammars: Concepts, Extensions, Implementations, and Application Scenarios (EK), p. 60.
BX-2011-Schuerr #graph grammar #in a nutshell: Triple Graph Grammars in a Nutshell (AS), p. 51.
MoDELS-2011-HermannEOCDX #correctness #graph grammar: Correctness of Model Synchronization Based on Triple Graph Grammars (FH, HE, FO, KC, ZD, YX), pp. 668–682.
MoDELS-2011-HermannEOCDX #correctness #graph grammar: Correctness of Model Synchronization Based on Triple Graph Grammars (FH, HE, FO, KC, ZD, YX), pp. 668–682.
PADL-2011-DevrieseP #combinator #domain-specific language #recursion #semiparsing: Explicitly Recursive Grammar Combinators — A Better Model for Shallow Parser DSLs (DD, FP), pp. 84–98.
REFSQ-2011-PostMP #case study #requirements #strict: Applying Restricted English Grammar on Automotive Requirements — Does it Work? A Case Study (AP, IM, AP), pp. 166–180.
LDTA-2011-GiegerichS #analysis #compilation: Yield grammar analysis in the Bellman’s GAP compiler (RG, GS), p. 7.
LDTA-2011-MiddelkoopDS #attribute grammar #evaluation: Stepwise evaluation of attribute grammars (AM, AD, SDS), p. 5.
LDTA-2011-StansiferW #parsing: Parsing reflective grammars (PS, MW), p. 10.
SLE-2011-FischerLZ #comparison #context-free grammar #parsing #testing: Comparison of Context-Free Grammars Based on Parsing Generated Test Data (BF, RL, VZ), pp. 324–343.
SLE-2011-KaminskiW #attribute grammar #functional #programming language: Integrating Attribute Grammar and Functional Programming Language Features (TK, EVW), pp. 263–282.
ICLP-2011-DrescherW #constraints #modelling #programming #set: Modelling Grammar Constraints with Answer Set Programming (CD, TW), pp. 28–39.
RTA-2011-KochemsO #analysis #functional #linear #reachability #using: Improved Functional Flow and Reachability Analyses Using Indexed Linear Tree Grammars (JK, CHLO), pp. 187–202.
DRR-2010-ChazalonC #definite clause grammar #documentation #using: Using definite clause grammars to build a global system for analyzing collections of documents (JC, BC), pp. 1–10.
ESOP-2010-MatsudaMHT #approach #grammarware #source code: A Grammar-Based Approach to Invertible Programs (KM, SCM, ZH, MT), pp. 448–467.
FoSSaCS-2010-ChambartS #composition #towards: Toward a Compositional Theory of Leftist Grammars and Transformations (PC, PS), pp. 237–251.
PASTE-2010-MizushimaMY #constant #parsing: Packrat parsers can handle practical grammars in mostly constant space (KM, AM, YY), pp. 29–36.
AFL-J-2008-DassowST10 #capacity #generative: Generative Capacity of Subregularly Tree Controlled Grammars (JD, RS, BT), pp. 723–740.
AFL-J-2008-LehtinenO10 #boolean grammar: Boolean Grammars and GSM Mappings (TL, AO), pp. 799–815.
DLT-J-2008-Csuhaj-VarjuDV10: Variants of Competence-Based Derivations in CD Grammar Systems (ECV, JD, GV), pp. 549–569.
DLT-2010-DassowM #context-free grammar #on the #strict: On Restricted Context-Free Grammars (JD, TM), pp. 434–435.
DLT-2010-EsikI #context-free grammar #on the: On Müller Context-Free Grammars (ZÉ, SI), pp. 173–184.
DLT-2010-Okhotin #algorithm #boolean grammar #parsing #performance: Fast Parsing for Boolean Grammars: A Generalization of Valiant’s Algorithm (AO), pp. 340–351.
ICALP-v2-2010-Zetzsche #on the #random: On Erasing Productions in Random Context Grammars (GZ), pp. 175–186.
LATA-2010-BuszkowskiL: Pregroup Grammars with Letter Promotions (WB, ZL), pp. 130–141.
LATA-2010-CarrascosaCGL #problem #word: Choosing Word Occurrences for the Smallest Grammar Problem (RC, FC, MG, GGIL), pp. 154–165.
LATA-2010-FlorencioF #approach #bound #consistency: Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach (CCF, HF), pp. 202–213.
LATA-2010-GagieG #grammarware #streaming: Grammar-Based Compression in a Streaming Model (TG, PG), pp. 273–284.
LATA-2010-KanazawaS #context-free grammar #multi #power of: The Copying Power of Well-Nested Multiple Context-Free Grammars (MK, SS), pp. 344–355.
LATA-2010-WeinbergN #context-free grammar #probability: Extending Stochastic Context-Free Grammars for an Application in Bioinformatics (FW, MEN), pp. 585–595.
SEFM-2010-XuZC #context-free grammar #generative #tool support: A Toolkit for Generating Sentences from Context-Free Grammars (ZX, LZ, HC), pp. 118–122.
IFL-2010-MiddelkoopDS #attribute grammar: Dependently Typed Attribute Grammars (AM, AD, SDS), pp. 105–120.
GT-VMT-2010-HoffmannM #graph grammar #metamodelling #modelling: Defining Models — Meta Models versus Graph Grammars (BH, MM).
ICGT-2010-BaldanBCKS #graph grammar #on the: On the Computation of McMillan’s Prefix for Contextual Nets and Graph Grammars (PB, AB, AC, BK, SS), pp. 91–106.
ICGT-2010-HermannEOG #analysis #behaviour #formal method #functional #graph grammar #model transformation: Formal Analysis of Functional Behaviour for Model Transformations Based on Triple Graph Grammars (FH, HE, FO, UG), pp. 155–170.
KDIR-2010-NakanoY #induction: Number Theory-based Induction of Deterministic Context-free L-system Grammar (RN, NY), pp. 194–199.
GPCE-2010-MiddelkoopDS #attribute grammar #type inference: Iterative type inference with attribute grammars (AM, AD, SDS), pp. 43–52.
PADL-2010-HafizF #attribute grammar #combinator #execution #lazy evaluation #specification: Lazy Combinators for Executable Specifications of General Attribute Grammars (RH, RAF), pp. 167–182.
POPL-2010-JimMW #algorithm #semantics: Semantics and algorithms for data-dependent grammars (TJ, YM, DW), pp. 417–430.
SAC-PL-J-2008-DennyM10 #algorithm #generative #lr #parsing: The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution (JED, BAM), pp. 943–979.
LDTA-J-2007-AkessonEH #attribute grammar #compilation #implementation #jastadd #using: Implementation of a Modelica compiler using JastAdd attribute grammars (JÅ, TE, GH), pp. 21–38.
LDTA-J-2007-CamachoMBV #automation #generative #tool support #using #verification: Automated generation of program translation and verification tools using annotated grammars (DOC, KM, MvdB, JJV), pp. 3–20.
LDTA-J-2007-WykBGK #attribute grammar #named: Silver: An extensible attribute grammar system (EVW, DB, JG, LK), pp. 39–54.
LDTA-2009-BaarsSV10: Typed Transformations of Typed Grammars: The Left Corner Transform (AIB, SDS, MV), pp. 51–64.
LDTA-2009-SloaneKV10 #attribute grammar #object-oriented: A Pure Object-Oriented Embedding of Attribute Grammars (AMS, LCLK, EV), pp. 205–219.
LDTA-2010-BastenV #ambiguity #detection #performance: Faster ambiguity detection by grammar filtering (BB, JJV), p. 5.
LDTA-2010-JohnstoneS: Tear-Insert-Fold grammars (AJ, ES), p. 6.
SLE-2010-BurgerKWA #attribute grammar #metamodelling #semantics: Reference Attribute Grammars for Metamodel Semantics (CB, SK, CW, UA), pp. 22–41.
SLE-2010-SoderbergH #attribute grammar #automation: Automated Selective Caching for Reference Attribute Grammars (ES, GH), pp. 2–21.
CSL-2010-BarthwalN #context-free grammar #formal method #normalisation: A Formalisation of the Normal Forms of Context-Free Grammars in HOL4 (AB, MN), pp. 95–109.
ICLP-2010-SaeedloeiG10 #definite clause grammar: Timed Definite Clause Ω-Grammars (NS, GG), pp. 212–221.
LICS-2010-KopczynskiT #complexity #image: Parikh Images of Grammars: Complexity and Applications (EK, AWT), pp. 80–89.
DATE-2009-DasV #approach #automation #design #grammarware #graph grammar #multi: A graph grammar based approach to automated multi-objective analog circuit design (AD, RV), pp. 700–705.
SIGMOD-2009-ArasuK #framework #grammarware #representation: A grammar-based entity representation framework for data cleaning (AA, RK), pp. 233–244.
ESOP-2009-SchaferEM #attribute grammar #coq #formal method #verification: Formalising and Verifying Reference Attribute Grammars in Coq (MS, TE, OdM), pp. 143–159.
FoSSaCS-2009-LohreyMS #parametricity #reduction: Parameter Reduction in Grammar-Compressed Trees (ML, SM, MSS), pp. 212–226.
SCAM-2009-LammelZ #grammar recovery #java #specification: Recovering Grammar Relationships for the Java Language Specification (RL, VZ), pp. 178–186.
PLDI-2009-SchwerdfegerW #composition: Verifiable composition of deterministic grammars (AS, EVW), pp. 199–210.
DLT-2009-Egecioglu #approximate #context-free grammar: Strongly Regular Grammars and Regular Approximation of Context-Free Languages (ÖE), pp. 207–220.
DLT-2009-KountouriotisNR #boolean grammar #game studies: A Game-Theoretic Characterization of Boolean Grammars (VK, CN, PR), pp. 334–347.
DLT-2009-Zetzsche #matrix #petri net: Erasing in Petri Net Languages and Matrix Grammars (GZ), pp. 490–501.
LATA-2009-DassowT #petri net: Grammars Controlled by Special Petri Nets (JD, ST), pp. 326–337.
LATA-2009-Kasprzik: Two Equivalent Regularizations for Tree Adjoining Grammars (AK), pp. 469–480.
LATA-2009-Masopust #context-free grammar #generative #power of: A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions (TM), pp. 554–565.
LATA-2009-MatobaNT #bias #performance #symmetry: Efficiency of the Symmetry Bias in Grammar Acquisition (RM, MN, ST), pp. 566–577.
LATA-2009-PardubskaPO #automaton #communication #correctness #on the #parallel: On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata (DP, MP, FO), pp. 660–671.
IFM-2009-LammelZ #convergence: An Introduction to Grammar Convergence (RL, VZ), pp. 246–260.
ICFP-2009-VieraSS #aspect-oriented #attribute grammar #haskell #how #programming: Attribute grammars fly first-class: how to do aspect oriented programming in Haskell (MV, SDS, WS), pp. 245–256.
GT-VMT-2009-EhrigHS #correctness #graph grammar #model transformation: Completeness and Correctness of Model Transformations based on Triple Graph Grammars with Negative Application Conditions (HE, FH, CS), pp. 67–84.
GT-VMT-2009-MachadoFR #aspect-oriented #graph grammar: Aspects for Graph Grammars (RM, LF, LR), pp. 115–127.
MoDELS-2009-EhrigEHP #correctness #graph grammar #model transformation #on the fly: On-the-Fly Construction, Correctness and Completeness of Model Transformations Based on Triple Graph Grammars (HE, CE, FH, UP), pp. 241–255.
MoDELS-2009-EhrigEHP #correctness #graph grammar #model transformation #on the fly: On-the-Fly Construction, Correctness and Completeness of Model Transformations Based on Triple Graph Grammars (HE, CE, FH, UP), pp. 241–255.
GTTSE-2009-Hedin #attribute grammar #jastadd #tutorial: An Introductory Tutorial on JastAdd Attribute Grammars (GH), pp. 166–200.
LDTA-2008-Basten09 #ambiguity #context-free grammar #detection #usability: The Usability of Ambiguity Detection Methods for Context-Free Grammars (BB), pp. 35–46.
LDTA-2008-FokkerS09 #abstract interpretation #attribute grammar #functional #source code #using: Abstract Interpretation of Functional Programs using an Attribute Grammar System (JF, SDS), pp. 117–133.
CC-2009-KatsSV #attribute grammar #evaluation #programming: Decorated Attribute Grammars: Attribute Evaluation Meets Strategic Programming (LCLK, AMS, EV), pp. 142–157.
CADE-2009-NguyenS #calculus #logic: A Tableau Calculus for Regular Grammar Logics with Converse (LAN, AS), pp. 421–436.
RTA-2009-GasconGS #unification: Unification with Singleton Tree Grammars (AG, GG, MSS), pp. 365–379.
ASE-2008-CamachoM #automation #named #using: APPAREIL: A Tool for Building Automated Program Translators Using Annotated Grammars (DOC, KM), pp. 489–490.
TACAS-2008-SaksenaWJ #ad hoc #graph grammar #modelling #protocol #verification: Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols (MS, OW, BJ), pp. 18–32.
ICPC-2008-Parr #embedded #reuse #semantics: The Reuse of Grammars with Embedded Semantic Actions (TP), pp. 5–10.
PLDI-2008-GodefroidKL #fuzzing #grammarware: Grammar-based whitebox fuzzing (PG, AK, MYL), pp. 206–215.
DLT-J-2007-Jez08 #boolean grammar: Conjunctive Grammars Generate Non-Regular Unary Languages (AJ), pp. 597–615.
AFL-2008-DassowT: Subregularly Tree Controlled Grammars and Languages (JD, BT), pp. 158–169.
AFL-2008-KelemenovaB: Monocultures in eco-grammar systems (AK, TB), pp. 208–219.
AFL-2008-LehtinenO #boolean grammar: Boolean grammars and gsm mappings (TL, AO), pp. 269–280.
CIAA-2008-Fujiyoshi #automaton #context-free grammar: Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees (AF), pp. 283–285.
CIAA-2008-NishiyamaM #html: A Translation from the HTML DTD into a Regular Hedge Grammar (TN, YM), pp. 122–131.
DLT-2008-Csuhaj-VarjuDV: Some New Modes of Competence-Based Derivations in CD Grammar Systems (ECV, JD, GV), pp. 228–239.
ICALP-B-2008-AxelssonHL #context-free grammar #incremental #satisfiability #using: Analyzing Context-Free Grammars Using an Incremental SAT Solver (RA, KH, ML), pp. 410–422.
ICALP-B-2008-Jurdzinski #recursion: Leftist Grammars Are Non-primitive Recursive (TJ), pp. 51–62.
ICALP-B-2008-Katsumata #attribute grammar #category theory #semantics: Attribute Grammars and Categorical Semantics (SyK), pp. 271–282.
LATA-2008-BechetDFG: Optional and Iterated Types for Pregroup Grammars (DB, AJD, AF, EG), pp. 88–100.
LATA-2008-BordihnH #distributed #random: Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems (HB, MH), pp. 125–136.
LATA-2008-DassowT #petri net: k-Petri Net Controlled Grammars (JD, ST), pp. 209–220.
LATA-2008-KallmeyerP #component #multi #on the #tuple: On the Relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range Concatenation Grammars (RCG) (LK, YP), pp. 263–274.
LATA-2008-MoriyaO #on the: On Alternating Phrase-Structure Grammars (EM, FO), pp. 397–408.
LATA-2008-Perekrestenko #bound #np-hard: Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard (AP), pp. 421–432.
GT-VMT-2006-HermannET08 #diagrams #graph grammar #inheritance #sequence chart #syntax #uml: A Typed Attributed Graph Grammar with Inheritance for the Abstract Syntax of UML Class and Sequence Diagrams (FH, HE, GT), pp. 261–269.
GT-VMT-2006-JakobS08 #graph grammar #metamodelling #modelling #using: View Creation of Meta Models by Using Modified Triple Graph Grammars (JJ, AS), pp. 181–190.
GT-VMT-2006-Kunert08 #automation #generative #metamodelling #modelling #source code: Semi-automatic Generation of Metamodels and Models From Grammars and Programs (AK), pp. 111–119.
GT-VMT-2006-WinkelmannTEK08 #constraints #generative #graph grammar #metamodelling #ocl #strict: Translation of Restricted OCL Constraints into Graph Constraints for Generating Meta Model Instances by Graph Grammars (JW, GT, KE, JMK), pp. 159–170.
GT-VC-2007-BruniBGM08 #architecture #graph grammar #modelling #using: Modelling Dynamic Software Architectures using Typed Graph Grammars (RB, AB, SG, HCM), pp. 39–53.
GT-VMT-2008-BrielerM #ambiguity #analysis #diagrams #graph grammar #sketching #syntax: Ambiguity Resolution for Sketched Diagrams by Syntax Analysis Based on Graph Grammars (FB, MM).
GT-VMT-2008-EhrigEH #algebra #approach #graph grammar #integration #model transformation: From Model Transformation to Model Integration based on the Algebraic Approach to Triple Graph Grammars (HE, KE, FH).
GT-VMT-2008-MazanekM #combinator #graph #parsing: Parsing of Hyperedge Replacement Grammars with Graph Parser Combinators (SM, MM).
ICGT-2008-BauderonCL: Pullback Grammars Are Context-Free (MB, RC, OL), pp. 366–378.
ICGT-2008-Dang #behaviour #graph grammar #ocl #validation: Triple Graph Grammars and OCL for Validating System Behavior (DHD), pp. 481–483.
ICGT-2008-DrewesHM #adaptation #graph #modelling: Adaptive Star Grammars for Graph Models (FD, BH, MM), pp. 442–457.
ICGT-2008-Heindel #category theory #morphism: Grammar Morphisms and Weakly Adhesive Categories (TH), pp. 493–495.
ICGT-2008-MazanekMM #algorithm: An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars (SM, SM, MM), pp. 39–53.
ICGT-2008-SchurrK #graph grammar: 15 Years of Triple Graph Grammars (AS, FK), pp. 411–425.
ICGT-2008-Striewe #graph grammar #implementation #state machine #using: Using a Triple Graph Grammar for State Machine Implementations (MS), pp. 514–516.
BX-2008-Laemmel1: A Suite for Coupled Grammar Transformations (RL), p. 39.
BX-2008-Schuerr1 #graph grammar #tutorial: Triple Graph Grammar (tutorial) (AS), p. 29.
PPDP-2008-ThiemannN #context-free grammar #metaprogramming: Macros for context-free grammars (PT, MN), pp. 120–130.
PADL-2008-FrostHC #ambiguity #combinator #parsing #recursion: Parser Combinators for Ambiguous Left-Recursive Grammars (RAF, RH, PC), pp. 167–181.
SAC-2008-DennyM #lr #parsing: IELR(1): practical LR(1) parser tables for non-LR(1) grammars with conflict resolution (JED, BAM), pp. 240–245.
ATEM-J-2006-DubeyJA #context-free grammar #learning #set: Learning context-free grammar rules from a set of program (AD, PJ, SKA), pp. 223–240.
ATEM-J-2006-HenrikssonHJZA #approach #metamodelling #reuse: Extending grammars and metamodels for reuse: the Reuseware approach (JH, FH, JJ, SZ, UA), pp. 165–184.
LDTA-2007-BouwersBV08 #grammarware #precedence: Grammar Engineering Support for Precedence Rule Recovery and Compatibility Checking (EB, MB, EV), pp. 85–101.
LDTA-2007-WykBGK08 #attribute grammar #named: Silver: an Extensible Attribute Grammar System (EVW, DB, JG, LK), pp. 103–116.
SLE-2008-AlvesV #case study #grammarware: A Case Study in Grammar Engineering (TLA, JV), pp. 285–304.
ASE-2007-MajumdarX #generative #testing #using: Directed test generation using symbolic grammars (RM, RGX), pp. 134–143.
ICDAR-2007-CostagliolaDR #diagrams #grammarware #sketching #using: Using Grammar-Based Recognizers for Symbol Completion in Diagrammatic Sketches (GC, VD, MR), pp. 1078–1082.
ICDAR-2007-Mace #constraints #documentation #incremental #multi #online #parsing: Context-Driven Constraint Multiset Grammars with Incremental Parsing for On-line Structured Document Interpretation (SM), pp. 442–446.
ICDAR-2007-OtaYSS #online #recognition: Online Handwritten Kanji Recognition Based on Inter-stroke Grammar (IO, RY, SS, SS), pp. 1188–1192.
ICDAR-2007-PrusaH #2d #recognition #using: Mathematical Formulae Recognition Using 2D Grammars (DP, VH), pp. 849–853.
ICSM-2007-CossetteW #analysis #dependence #evaluation #semiparsing #using: Polylingual Dependency Analysis Using Island Grammars: A Cost Versus Accuracy Evaluation (BC, RJW), pp. 214–223.
SCAM-2007-MagnussonEH #attribute grammar: Extending Attribute Grammars with Collection Attributes--Evaluation and Applications (EM, TE, GH), pp. 69–80.
WCRE-2007-DuffyM #approach #automation #c++ #grammar recovery: An Automated Approach to Grammar Recovery for a Dialect of the C++ Language (EBD, BAM), pp. 11–20.
WCRE-2007-WalkinshawBHS #grammar inference #interactive #reverse engineering #state machine: Reverse Engineering State Machines by Interactive Grammar Inference (NW, KB, MH, SS), pp. 209–218.
CIAA-J-2006-BastienCFR07 #exponential: Reducing Simple Grammars: Exponential against Highly-Polynomial Time in Practice (CB, JC, WF, WR), pp. 715–725.
CIAA-2007-BrabrandGM #ambiguity #context-free grammar: Analyzing Ambiguity of Context-Free Grammars (CB, RG, AM), pp. 214–225.
CIAA-2007-Marschner #transducer #using: Efficiently Matching with Local Grammars Using Prefix Overlay Transducers (CM), pp. 314–316.
DLT-2007-Jez #boolean grammar: Conjunctive Grammars Can Generate Non-regular Unary Languages (AJ), pp. 242–253.
ICALP-2007-Schmitz #ambiguity #context-free grammar #detection: Conservative Ambiguity Detection in Context-Free Grammars (SS), pp. 692–703.
LATA-2007-Bensch #approach #context-sensitive grammar #parallel: An Approach to Parallel Mildly Context-Sensitive Grammar Formalisms (SB), pp. 91–102.
LATA-2007-BordihnV #on the: On leftmost derivations in CD grammar systems (HB, GV), pp. 187–198.
LATA-2007-FrancezK #automaton: Pushdown automata with cancellation and commutation-augmented pregroups grammars (NF, MK), pp. 7–26.
LATA-2007-MasopustM #complexity: Descriptional Complexity of Grammars Regulated by Context Conditions (TM, AM), pp. 403–412.
LATA-2007-NomikosR #boolean grammar: Locally Stratified Boolean Grammars (CN, PR), pp. 437–448.
LATA-2007-OgasawaraK #approximate #performance #product line: Stochastically Approximating Tree Grammars by Regular Grammars and Its Application to Faster ncRNA Family Annotation (KO, SK), pp. 461–472.
LATA-2007-Okhotin #ambiguity #boolean grammar: Unambiguous Boolean grammars (AO), pp. 473–484.
LATA-2007-Thorne #bound #finite: Categorial Module Grammars of Bounded Size have Finite Bounded Density (CT), pp. 577–588.
AGTIVE-2007-AschenbrennerG #graph #graph grammar #using: Transforming Scene Graphs Using Triple Graph Grammars — A Practice Report (NA, LG), pp. 32–43.
AGTIVE-2007-KniemeyerBHK #approach #architecture #biology #graph transformation #parallel #relational: Relational Growth Grammars — A Parallel Graph Transformation Approach with Applications in Biology and Architecture (OK, GB, RH, WK), pp. 152–167.
AGTIVE-2007-Weber-Jahnke #graph grammar #information management #modelling: Modelling of Longitudinal Information Systems with Graph Grammars (JHWJ), pp. 59–65.
GT-VMT-2007-LaraGB #generative #graph grammar #specification: Triple Patterns: Compact Specifications for the Generation of Operational Triple Graph Grammar Rules (JdL, EG, PB).
HCI-IPT-2007-MaceA #constraints #design #diagrams #editing #multi: Design of a Pen-Based Electric Diagram Editor Based on Context-Driven Constraint Multiset Grammars (SM, ÉA), pp. 418–428.
ICEIS-AIDSS-2007-KrohaR #classification #using: Using Grammars for Text Classification (PK, TR), pp. 259–264.
SEKE-2007-SilvaMPV #context-free grammar #evolution #grammar inference #xml: XML Schema Evolution by Context Free Grammar Inference (JCTdS, MAM, ATRP, SRV), p. 444–?.
ECOOP-2007-WykKBS #attribute grammar #grammarware #java: Attribute Grammar-Based Language Extensions for Java (EVW, LK, DB, AS), pp. 575–599.
TOOLS-EUROPE-2007-LohmannGJS #graph grammar #model transformation #workflow: Applying Triple Graph Grammars For Pattern-Based Workflow Model Transformations (CL, JG, JJ, TS), pp. 253–273.
ESEC-FSE-2007-MajumdarX #generative #testing #using: Directed test generation using symbolic grammars (RM, RGX), pp. 553–556.
LDTA-J-2003-MagnussonH #attribute grammar #evaluation: Circular reference attributed grammars — their evaluation and applications (EM, GH), pp. 21–37.
ICLP-2007-Palshikar #execution #graph grammar #prolog #representation: Representation and Execution of a Graph Grammar in Prolog (GKP), pp. 442–443.
ISSTA-2007-HughesB #composition #interface #model checking: Interface grammars for modular software model checking (GH, TB), pp. 39–49.
DLT-J-2005-Okhotin06 #algorithm #boolean grammar #glr #parsing: Generalized Lr Parsing Algorithm for Boolean Grammars (AO), pp. 629–664.
CIAA-2006-BastienCFR #exponential: Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice (CB, JC, WF, WR), pp. 90–101.
DLT-2006-BastienCFR #context-free grammar #equivalence: Equivalence of Functions Represented by Simple Context-Free Grammars with Output (CB, JC, WF, WR), pp. 71–82.
DLT-2006-BertoniCP #context-free grammar #xml: Context-Free Grammars and XML Languages (AB, CC, BP), pp. 108–119.
DLT-2006-DediuKKN #approach #generative #graph grammar: Contextual Hypergraph Grammars — A New Approach to the Generation of Hypergraph Languages (AHD, RKH, HJK, BN), pp. 327–338.
DLT-2006-DrewesTEMW: Bag Context Tree Grammars (FD, CdT, SE, BvdM, APJvdW), pp. 226–237.
DLT-2006-KountouriotisNR #boolean grammar #semantics: Well-Founded Semantics for Boolean Grammars (VK, CN, PR), pp. 203–214.
DLT-2006-Lakshmanan: End-Marked Maximal Depth-First Contextual Grammars (LK), pp. 339–350.
ICALP-v2-2006-Jurdzinski #complexity #on the #problem #safety: On Complexity of Grammars Related to the Safety Problem (TJ), pp. 432–443.
ICGT-2006-DrewesHJME #adaptation: Adaptive Star Grammars (FD, BH, DJ, MM, NVE), pp. 77–91.
ICGT-2006-JakobKS #graph grammar #specification: Non-materialized Model View Specification with Triple Graph Grammars (JJ, AK, AS), pp. 321–335.
ICGT-2006-MendizabalD #analysis #distributed #graph grammar #non-functional #probability #using: Non-functional Analysis of Distributed Systems in Unreliable Environments Using Stochastic Object Based Graph Grammars (OMM, FLD), pp. 275–290.
ICGT-2006-RiedlSF #generative #graph grammar #order #strict #string #word: String Generating Hypergraph Grammars with Word Order Restrictions (MR, SS, IF), pp. 138–152.
CAiSE-2006-RosemannRIG #case study #evolution #modelling #process: A Study of the Evolution of the Representational Capabilities of Process Modeling Grammars (MR, JR, MI, PFG), pp. 447–461.
ICEIS-AIDSS-2006-Fornells-HerreraRMB #approach #evolution: Decision Support System for Breast Cancer Diagnosis by a Meta-Learning Approach Based on Grammar Evolution (AFH, EGiR, EBiM, JMB), pp. 222–229.
ICPR-v2-2006-RomeuLSL #automation #generative #sketching: Automatic Adjacency Grammar Generation from User Drawn Sketches (JMR, BL, GS, JL), pp. 1026–1029.
SEKE-2006-JavedMSB #context-free grammar #domain-specific language #incremental: Incrementally Inferring Context-Free Grammars for Domain-Specific Languages (FJ, MM, APS, BRB), pp. 363–368.
MoDELS-2006-GieseW #graph grammar #incremental: Incremental Model Synchronization with Triple Graph Grammars (HG, RW), pp. 543–557.
MoDELS-2006-GieseW #graph grammar #incremental: Incremental Model Synchronization with Triple Graph Grammars (HG, RW), pp. 543–557.
SAC-2006-DubeyJA #keyword #source code: A deterministic technique for extracting keyword based grammar rules from programs (AD, PJ, SKA), pp. 1631–1632.
ATEM-2006-FavreGLW #metamodelling #ontology: 3rd International Workshop on Metamodels, Schemas, Grammars and Ontologies (JMF, DG, RL, AW), pp. 52–55.
LDTA-2006-CamachoMBV #automation: Automated Derivation of Translators From Annotated Grammars (DOC, KM, MvdB, JJV), pp. 121–137.
LDTA-2006-RebernakMHP #aspect-oriented #attribute grammar #compilation #named: AspectLISA: An Aspect-oriented Compiler Construction System Based on Attribute Grammars (DR, MM, PRH, MJVP), pp. 37–53.
LDTA-2006-SierraF #agile #attribute grammar #framework #prolog #prototype: A Prolog Framework for the Rapid Prototyping of Language Processors with Attribute Grammars (JLS, AFV), pp. 19–36.
HPDC-2006-GaoSC #approximate: Path Grammar Guided Trace Compression and Trace Approximation (XG, AS, LC), pp. 57–68.
ICLP-2006-DahlG #semantics: Semantic Property Grammars for Knowledge Extraction from Biomedical Text (VD, BG), pp. 442–443.
TestCom-2006-LammelS #combinator #grammarware #testing: Controllable Combinatorial Coverage in Grammar-Based Testing (RL, WS), pp. 19–38.
ASE-2005-HennessyP #analysis #generative #grammarware #testing: An analysis of rule coverage as a criterion in generating minimal test suites for grammar-based software (MH, JFP), pp. 104–113.
ICDAR-2005-CostagliolaDR #diagrams #sketching: Sketch Grammars: A Formalism for Describing and Recognizing Diagrammatic Sketch Languages (GC, VD, MR), pp. 1226–1231.
ICDAR-2005-HandleyNZ #comprehension #context-free grammar #documentation #probability #using: Document Understanding System Using Stochastic Context-Free Grammars (JCH, AMN, RZ), pp. 511–515.
ESOP-2005-LeeYY #analysis #automation #grammarware #pointer #source code #using #verification: Automatic Verification of Pointer Programs Using Grammar-Based Shape Analysis (OL, HY, KY), pp. 124–140.
FASE-2005-ReussnerHH #component #contract #graph grammar #modelling #parametricity: Modelling Parametric Contracts and the State Space of Composite Components by Graph Grammars (RHR, JH, AH), pp. 80–95.
SCAM-2005-SchordanQ #attribute grammar #sequence #specification: Specifying Transformation Sequences as Computation on Program Fragments with an Abstract Attribute Grammar (MS, DJQ), pp. 97–106.
CIAA-J-2004-AllauzenMR05 #algorithm #design #library: The design principles and algorithms of a weighted grammar library (CA, MM, BR), pp. 403–421.
CIAA-J-2004-Yli-Jyra05 #approximate #dependence #regular expression: Approximating dependency grammars through intersection of star-free regular languages (AYJ), pp. 565–579.
CIAA-2005-BastienCFR #equivalence #normalisation: Prime Normal Form and Equivalence of Simple Grammars (CB, JC, WF, WR), pp. 78–89.
CIAA-2005-Tellier #automaton: Automata and AB-Categorial Grammars (IT), pp. 353–355.
DLT-2005-Okhotin #boolean grammar #lr #parsing: LR Parsing for Boolean Grammars (AO), pp. 362–373.
ICALP-2005-KnapikNUW #automaton: Unsafe Grammars and Panic Automata (TK, DN, PU, IW), pp. 1450–1461.
SEKE-2005-LiuCBGROA #analysis #approach #component #composition #quality #requirements #two-level grammar: Quality of Service-Driven Requirements Analysis for Component Composition: A Two-Level Grammar+Approach (SHL, FC, BRB, JGG, RRR, AMO, MA), pp. 731–734.
SIGIR-2005-ViolaN #context-free grammar #learning #using: Learning to extract information from semi-structured text using a discriminative context free grammar (PAV, MN), pp. 330–337.
ECMDA-FA-2005-GrunskeGL #graph grammar #model transformation #specification #visual notation: A Graphical Specification of Model Transformations with Triple Graph Grammars (LG, LG, ML), pp. 284–298.
SAC-2005-FalcoTCG05a #approach #clustering #grammarware #novel #programming #search-based: A novel grammar-based genetic programming approach to clustering (IDF, ET, ADC, FG), pp. 928–932.
SAC-2005-WuGRM #debugging #domain-specific language #weaving: Weaving a debugging aspect into domain-specific language grammars (HW, JGG, SR, MM), pp. 1370–1374.
LDTA-2005-CrepinsekMBJS #context-free grammar #domain-specific language: Inferring Context-Free Grammars for Domain-Specific Languages (MC, MM, BRB, FJ, APS), pp. 99–116.
SPLC-2005-Batory #feature model #modelling: Feature Models, Grammars, and Propositional Formulas (DSB), pp. 7–20.
CIAA-2004-AllauzenMR #library: A General Weighted Grammar Library (CA, MM, BR), pp. 23–34.
CIAA-2004-Shan #graph grammar #modelling #probability: Stochastic Context-Free Graph Grammars for Glycoprotein Modelling (BS), pp. 247–258.
CIAA-2004-Yli-Jyra #approximate #dependence #regular expression: Approximating Dependency Grammars Through Intersection of Regular Languages (AYJ), pp. 281–292.
DLT-2004-BeekCHV #on the: On Competence in CD Grammar Systems (MHtB, ECV, MH, GV), pp. 76–88.
DLT-2004-InenagaST #algorithm #context-free grammar #pattern matching #performance #subclass: An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars (SI, AS, MT), pp. 225–236.
ICALP-2004-Rytter #algorithm #encoding #string: Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Input (WR), pp. 15–27.
AFP-2004-DijkstraS04 #attribute grammar #haskell #type system: Typing Haskell with an Attribute Grammar (AD, SDS), pp. 1–72.
ICGT-2004-FerreiraR #graph grammar #object-oriented: Derivations in Object-Oriented Graph Grammars (APLF, LR), pp. 416–430.
ICGT-2004-GuerraL #graph transformation #integration #metamodelling #towards: Event-Driven Grammars: Towards the Integration of Meta-modelling and Graph Transformation (EG, JdL), pp. 54–69.
ICGT-2004-SeifertF #generative #graph grammar #parsing #string: Parsing String Generating Hypergraph Grammars (SS, IF), pp. 352–367.
CIKM-2004-FanGXJ #composition #integration #xml: Composable XML integration grammars (WF, MNG, MX, XJ), pp. 2–11.
CIKM-2004-SrinivasanADZ #analysis #grammarware #web: Grammar-based task analysis of web logs (SS, AA, PMD, VZ), pp. 244–245.
ECOOP-2004-EkmanH #attribute grammar: Rewritable Reference Attributed Grammars (TE, GH), pp. 144–169.
POPL-2004-Ford #parsing expression grammar: Parsing expression grammars: a recognition-based syntactic foundation (BF), pp. 111–122.
SAC-2004-PanagopoulosPP #attribute grammar #evaluation #hardware: A hardware extension of the RISC microprocessor for Attribute Grammar evaluation (IP, CP, GKP), pp. 897–904.
LDTA-2004-GoldreiS #attribute grammar #formal method #off the shelf #using #verification: Using Off-the-Shelf Formal Methods to Verify Attribute Grammar Properties (SG, AMS), pp. 33–54.
LDTA-2004-JohnstoneSE #algorithm #case study #glr #parsing: The Grammar Tool Box: A Case Study Comparing GLR Parsing Algorithms (AJ, ES, GRE), pp. 97–113.
LDTA-2004-LohmannRS #attribute grammar #migration #recursion #semantics: Semantics-preserving Migration of Semantic Rules During Left Recursion Removal in Attribute Grammars (WL, GR, MS), pp. 133–148.
DocEng-2003-GancarskiH #attribute grammar #documentation #information retrieval #interactive #xml: Interactive information retrieval from XML documents represented by attribute grammars (ALG, PRH), pp. 171–174.
ICDAR-2003-AmanoA #analysis #documentation #grammarware #graph grammar: Graph Grammar Based Analysis System of Complex Table Form Document (AA, NA), pp. 916–920.
ICDAR-2003-BaldiMS #classification #set #using: Using tree-grammars for training set expansion in page classification (SB, SM, GS), pp. 829–833.
CSMR-2003-LohmannR #migration #towards: Towards Automatical Migration of Transformation Rules after Grammar Extension (WL, GR), pp. 30–39.
ICSM-2003-KlusenerL #semiparsing: Deriving tolerant grammars from a base-line grammar (SK, RL), p. 179–?.
CIAA-2003-BravoN #parsing: Building Context-Sensitive Parsers from CF Grammars with Regular Control Language (CB, JJN), pp. 306–308.
DLT-2003-DrewesE #branch: Branching Grammars: A Generalization of ET0L Systems (FD, JE), pp. 266–278.
DLT-2003-Okhotin #boolean grammar: Boolean Grammars (AO), pp. 398–410.
DLT-2003-ReghizziP: Tile Rewriting Grammars (SCR, MP), pp. 206–217.
AGTIVE-2003-DottiRS #analysis #behaviour #fault #graph grammar #specification #using: Specification and Analysis of Fault Behaviours Using Graph Grammars (FLD, LR, OMdS), pp. 120–133.
AGTIVE-2003-Fischer #graph grammar #modelling: Modeling Discontinuous Constituents with Hypergraph Grammars (IF), pp. 163–169.
AGTIVE-2003-HaaseMBG #agile #architecture #graph grammar #prototype: A Domain Specific Architecture Tool: Rapid Prototyping with Graph Grammars (TH, OM, BB, FHG), pp. 236–242.
AGTIVE-2003-Klempien-HinrichsMT #3d: Collage Grammars for Collision-Free Growing of Objects in 3D Scenes (RKH, TM, CvT), pp. 383–397.
AGTIVE-2003-Rising #graph grammar #graph transformation #multi #semantics: MPEG-7 Semantic Descriptions: Graph Transformations, Graph Grammars, and the Description of Multimedia (Invited Talk) (HKR), pp. 369–382.
GPCE-2003-SaraivaS #attribute grammar #generative #tool support: Generating Spreadsheet-Like Tools from Strong Attribute Grammars (JS, SDS), pp. 307–323.
LDTA-2003-MagnussonH #attribute grammar #evaluation: Circular Reference Attributed Grammars — Their Evaluation and Applications (EM, GH), pp. 532–554.
VLDB-2002-BenediktCFRZZ: DTD-Directed Publishing with Attribute Translation Grammars (MB, CYC, WF, RR, SZ, AZ), pp. 838–849.
TACAS-2002-Backhouse #attribute grammar #functional #semantics: A Functional Semantics of Attribute Grammars (KB), pp. 142–157.
IWPC-2002-Moonen #impact analysis #lightweight #semiparsing #using: Lightweight Impact Analysis using Island Grammars (LM), pp. 219–228.
SCAM-2002-DeanCMS #programming #txl: Grammar Programming in TXL (TRD, JRC, AJM, KAS), p. 93–?.
PEPM-2002-SecherS #graph: From checking to inference via driving and dag grammars (JPS, MHS), pp. 41–51.
STOC-2002-CharikarLLPPRSS #approximate #complexity #modelling: Approximating the smallest grammar: Kolmogorov complexity in natural models (MC, EL, DL, RP, MP, AR, AS, AS), pp. 792–801.
CIAA-2002-AnselmoGV #automaton #finite #self: Finite Automata and Non-self-Embedding Grammars (MA, DG, SV), pp. 47–56.
CIAA-2002-Bruggemann-KleinW #context-free grammar #on the #parsing #predict: On Predictive Parsing and Extended Context-Free Grammars (ABK, DW), pp. 239–247.
CIAA-2002-Okhotin02a #boolean grammar #generative #parsing: Whale Calf, a Parser Generator for Conjunctive Grammars (AO), pp. 213–220.
ICGT-2002-MontanariR #algebra #graph grammar #linear #order: Linear Ordered Graph Grammars and Their Algebraic Foundations (UM, LR), pp. 317–333.
ICML-2002-OatesDB #context-free grammar #learning: Learning k-Reversible Context-Free Grammars from Positive Structural Examples (TO, DD, VB), pp. 459–465.
ICPR-v2-2002-KumanoAAUST #analysis #editing #video: Video Editing Support System Based on Video Grammar and Content Analysis (MK, YA, MA, KU, KS, KT), pp. 1031–1036.
SEKE-2002-BryantBARO #assembly #component #generative #specification #two-level grammar #using: Formal specification of generative component assembly using two-level grammar (BRB, CCB, MA, RRR, AMO), pp. 209–212.
SEKE-2002-CostagliolaDFG #modelling #using #visual notation: Using extended positional grammars to develop visual modeling languages (GC, VD, FF, CG), pp. 201–208.
GPCE-2002-Saraiva #attribute grammar #component #higher-order #programming: Component-Based Programming for Higher-Order Attribute Grammars (JS), pp. 268–282.
SAC-2002-SinghS #generative #grammarware: Grammar based off line generation of disposable credit card numbers (AS, ALMdS), pp. 221–228.
LDTA-2002-Boyland #attribute grammar #incremental: Incremental Evaluators for Remote Attribute Grammars (JB), pp. 9–29.
LDTA-2002-KortLV #deployment: The Grammar Deployment Kit — System Demonstration (JK, RL, CV), pp. 117–123.
CC-2002-WykMBK #attribute grammar #composition #design: Forwarding in Attribute Grammars for Modular Language Design (EVW, OdM, KB, PK), pp. 128–142.
ICLP-2002-Christiansen #constraints #logic: Logical Grammars Based on Constraint Handling Rules (HC), p. 481.
ICDAR-2001-AmanoAMSS #analysis #documentation #grammarware #synthesis: Table Form Document Synthesis by Grammar-Based Structure Analysis (AA, NA, TM, TS, KS), pp. 533–539.
ICDAR-2001-SanchezL #graph grammar: A Graph Grammar to Recognize Textured Symbols (GS, JL), pp. 465–469.
FASE-2001-Lammel #testing: Grammar Testing (RL), pp. 201–216.
WCRE-2001-Moonen #generative #robust #semiparsing #using: Generating Robust Parsers Using Island Grammars (LM), p. 13–?.
PLDI-2001-EvansF #bytecode: Bytecode Compression via Profiled Grammar Rewriting (WSE, CWF), pp. 148–155.
SAS-2001-LiuLS #constraints #grammarware: Solving Regular Tree Grammar Based Constraints (YAL, NL, SDS), pp. 213–233.
DLT-2001-Csuhaj-VarjuV #communication #parallel: Parallel Communicating Grammar Systems with Incomplete Information Communication (ECV, GV), pp. 359–368.
DLT-2001-FernauS #algebra #perspective: Valuated and Valence Grammars: An Algebraic View (HF, RS), pp. 281–292.
DLT-2001-Hoogeboom #revisited: Context-Free Valence Grammars — Revisited (HJH), pp. 293–303.
FME-2001-Lammel #adaptation: Grammar Adaptation (RL), pp. 550–570.
MLDM-2001-Fernau #learning #xml: Learning XML Grammars (HF), pp. 73–87.
TOOLS-USA-2001-Arsanjani01d #adaptation #component #design #self: Grammar-Oriented Object Design: Creating Adaptive Collaborations and Dynamic Configurations with Self-Describing Components and Services (AA), pp. 409–414.
RE-2001-WatahikiS #approach: Scenario Patterns Based on Case Grammar Approach (KW, MS), pp. 300–301.
SAC-2001-PowerM #lalr #metric: Exploiting metrics to facilitate grammar transformation into LALR format (JFP, BAM), pp. 636–640.
WCRE-J-1997-BrandSV00 #component #context-free grammar #generative #legacy: Generation of components for software renovation factories from context-free grammars (MvdB, MPAS, CV), pp. 209–266.
IWPC-2000-PowerM #analysis #context-free grammar: Metric-Based Analysis of Context-Free Grammars (JFP, BAM), pp. 171–178.
CIAA-2000-DrewesEKK #grid #image: Computing Raster Images from Grid Picture Grammars (FD, SE, RKH, HJK), pp. 113–121.
ICML-2000-MuggletonBS #biology #learning #product line #sequence: Learning Chomsky-like Grammars for Biological Sequence Families (SM, CHB, AS), pp. 631–638.
ICPR-v3-2000-SanchisVJ #performance #recognition #speech #verification #word: Efficient Use of the Grammar Scale Factor to Classify Incorrect Words in Speech Recognition Verification (AS, EV, VMJ), pp. 3278–3281.
TOOLS-PACIFIC-2000-ButlerM #attribute grammar #generative #named #parsing: YooccLa: A Parser Generator for L-Attributed Grammars (GB, CM), pp. 214–227.
GCSE-2000-JongeV #contract: Grammars as Contracts (MdJ, JV), pp. 85–99.
WICSA-1999-HirschIM #constraints #graph grammar #modelling #theorem proving: Modeling Software Architecutes and Styles with Graph Grammars and Constraint Solving (DH, PI, UM), pp. 127–144.
ICDAR-1999-KosmalaRLP #graph grammar #markov #modelling #online #recognition #using: On-Line Handwritten Formula Recognition using Hidden Markov Models and Context Dependent Graph Grammars (AK, GR, SL, LP), pp. 107–110.
FoSSaCS-1999-BaldranCM #graph grammar #semantics: Unfolding and Event Structure Semantics for Graph Grammars (PB, AC, UM), pp. 73–89.
DLT-1999-BordihnH #component #distributed: Cooperating distributed grammar systems with non-terminating components (HB, MH), pp. 305–315.
DLT-1999-Martin-VideM: Contextual grammars with trajectories (CMV, AM), pp. 362–374.
DLT-1999-Wich #ambiguity #context-free grammar #exponential: Exponential ambiguity of context-free grammars (KW), pp. 125–138.
AGTIVE-1999-BaresiP #analysis #graph grammar #programmable: A Formal Definition of Stuctured Analysis with Programmable Graph Grammars (LB, MP), pp. 193–208.
AGTIVE-1999-Gruner #approach #consistency #distributed #graph grammar #modelling: A Combined Graph Schema and Graph Grammar Approach to Consistency in Distributed Data Modeling (SG), pp. 247–254.
AGTIVE-1999-RibeiroC #composition #graph grammar #modelling #simulation #using: Compositional Construction of Simulation Models Using Graph Grammars (LR, BC), pp. 87–94.
HCI-CCAD-1999-AntonaAS #approach #design #grammarware #human-computer: A grammar-based approach for populating HCI design spaces (MA, DA, CS), pp. 843–847.
ICML-1999-SakakibaraK #context-free grammar #learning #using: GA-based Learning of Context-Free Grammars using Tabular Representations (YS, MK), pp. 354–360.
POPL-1999-Ruckert: Continuous Grammars (MR), pp. 303–310.
RTA-1999-Courcelle #graph #logic: Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas (BC), pp. 90–91.
DATE-1998-EconomakosPT #attribute grammar #automation #design #grammarware #named: AGENDA: An Attribute Grammar Driven Environment for the Design Automation of Digital Systems (GE, GKP, PT), pp. 933–934.
DATE-1998-ObergHK #communication #grammarware #hardware #protocol #scheduling #synthesis: Scheduling of Outputs in Grammar-based Hardware Synthesis of Data Communication Protocols (JÖ, AH, AK), pp. 596–603.
PODS-1998-NevenB #attribute grammar #documentation #query: Expressiveness of Structured Document Query Languages Based on Attribute Grammars (FN, JVdB), pp. 11–17.
WIA-1998-AlbertGW #algorithm #context-free grammar #normalisation: Extended Context-Free Grammars and Normal Form Algorithms (JA, DG, DW), pp. 1–12.
TAGT-1998-BaldanCM #graph grammar: Unfolding of Double-Pushout Graph Grammars is a Coreflection (PB, AC, UM), pp. 145–163.
TAGT-1998-Drewes #generative #power of: Some Remarks on the Generative Power of Collage Grammars and Chain-Code Grammars (FD), pp. 1–14.
TAGT-1998-EngelfrietM #graph grammar: Tree Languages Generated be Context-Free Graph Grammars (JE, SM), pp. 15–29.
TAGT-1998-Hrischuk #automation #graph grammar #process #using: A Model Making Automation Process (MMAP) Using a Graph Grammar Formalism (CEH), pp. 442–454.
TAGT-1998-Pfaltz: Neighborhood Expansion Grammars (JLP), pp. 30–44.
ICML-1998-StuartB #learning: Learning the Grammar of Dance (JMS, EB), pp. 547–555.
SAC-1998-EconomakosPT #attribute grammar #multi #synthesis: Incorporating multi-pass attribute grammars for the high-level synthesis of ASICs (GE, GKP, PT), pp. 45–49.
CC-1998-Boyland #attribute grammar #dependence: Analyzing Direct Non-local Dependencies in Attribute Grammars (JB), pp. 31–49.
ASE-1997-Sucrow #graph grammar #human-computer #interactive #specification: Formal Specification of Human-Computer Interaction by Graph Grammars under Consideration of Information Resources (BS), pp. 28–35.
ITiCSE-1997-Proulx #recursion: Recursion and grammars for CS2 (VKP), pp. 74–76.
WCRE-1997-BrandSV #component #context-free grammar #generative #legacy: Generation of Components for Software Renovation Factories from Context-Free Grammars (MvdB, MPAS, CV), p. 144–?.
SAS-1997-CorrensonDPR #attribute grammar #deforestation #functional #programming: Attribute Grammars and Functional Programming Deforestation (LC, ÉD, DP, GR), p. 365.
DLT-1997-FernauHF #bound #distributed: Bounding resources in Cooperating Distributed Grammar Systems (HF, MH, RF), pp. 261–272.
DLT-1997-Kurerov #graph grammar: Resolution-Similar Graph Grammars (YNK), pp. 567–577.
DLT-1997-Mihalache #communication #hybrid #parallel: Hybrid Parallel Communicating Grammar Systems (VM), pp. 175–189.
DLT-1997-MrazPP #automaton: Deleting Automata with a Restart Operation and Marcus Grammars (FM, MP, MP), pp. 329–342.
DLT-1997-WatanabeT #attribute grammar #evaluation #using: An Attribute Evaluation of One-Pass Attribute Grammars Using Value Estimate (YW, TT), pp. 155–165.
WIA-1997-Miller #algorithm #context-free grammar #normalisation #towards: Towards a Meta-Normal Form Algorithm for Context-Free Grammars (CLM), pp. 133–143.
ICFP-1997-Duris #attribute grammar #deforestation #functional #programming: Functional Programming and Attribute Grammars Deforestation (ÉD), p. 312.
ICFP-1997-KrasnogorLMP97a #modelling #string: Modelling String Folding with G2L Grammars (NK, PEML, PM, DAP), p. 314.
GG-Handbook-Vol1-DrewesKH #graph grammar: Hyperedge Replacement, Graph Grammars (FD, HJK, AH), pp. 95–162.
GG-Handbook-Vol1-EngelfrietR #graph grammar: Node Replacement Graph Grammars (JE, GR), pp. 1–94.
PLILP-1997-JanousekM #lr: Formal Translations Described by Translation Grammars with LR(k) Input Grammars (JJ, BM), pp. 421–422.
SAC-1997-FontanaF #documentation #evaluation #fuzzy #using: Using fuzzy grammars for the evaluation of SGML-based documents (FAF, FF), pp. 202–203.
ASF+SDF-1997-BrandSV #cobol #legacy #re-engineering: Obtaining a COBOL grammar from legacy code for reengineering purposes (MvdB, MPAS, CV), p. 6.
ICLP-1997-DahlTL #natural language: Assumption Grammars for Processing Natural Language (VD, PT, RL), pp. 256–270.
CSCW-1996-GlancePP #flexibility #process: Generalized Process Structure Grammars GPSG for Flexible Representations of Work (NSG, DP, RP), pp. 180–189.
AdaEurope-1996-SotirovskiK #ada: Handling Irregular Grammars in Ada (DMS, PK), pp. 312–318.
PLILP-1996-ParigotRJD #attribute grammar: Dynamic Attribute Grammars (DP, GR, MJ, ÉD), pp. 122–136.
FSE-1996-Metayer #architecture #graph grammar: Software Architecture Styles as Graph Grammars (DLM), pp. 15–23.
CADE-1996-Luz-Filho #logic #proving #specification #theorem proving: Grammar Specification in Categorial Logics and Theorem Proving (SFLF), pp. 703–717.
CSL-1996-Matzinger #modelling #using: Computational Representations of Herbrand Models Using Grammars (RM), pp. 334–348.
JICSLP-1996-Chau #definite clause grammar #specification: Specification of Complex Systems with Definite Clause Grammar (Poster Abstract) (HLC), p. 544.
JICSLP-1996-Ridoux #attribute grammar #prolog: Engineering Transformations of Attributed Grammars in λProlog (OR), pp. 244–258.
ICDAR-v1-1995-AkindeleB #documentation #modelling #using: Construction of generic models of document structures using inference of tree grammars (OTA, AB), pp. 206–209.
ICDAR-v2-1995-Baumann #graph grammar #music #recognition: A simplified attributed graph grammar for high-level music recognition (SB), pp. 1080–1083.
DLT-1995-BordihnF #bibliography #perspective: Accepting Grammars and Systems: An Overview (HB, HF), pp. 199–208.
DLT-1995-Freund #array: Array Grammars with Prescribed Teams of Array Productions (RF), pp. 220–229.
DLT-1995-JancarMPPV #automaton #context-free grammar: Restarting Automata, Marcus Grammars and Context-Free Languages (PJ, FM, MP, MP, JV), pp. 102–111.
DLT-1995-KimuraT #graph grammar: Timed Attribute Hypergraph Grammars and Their Based Properties (YK, TT), pp. 319–328.
DLT-1995-MateiT #context-free grammar: (0, 1)-Total Pure Context-Free Grammars (CM, FLT), pp. 148–153.
DLT-1995-Mihalache #communication #parallel: Szilard Languages Associated to Parallel Communicating Grammar Systems (VM), pp. 247–256.
DLT-1995-Stiebe: Some New Decision Results for Edge Grammars (RS), pp. 329–338.
ICALP-1995-Paun #approach: Grammar Systems: A Grammatical Approach to Distribution and Cooperation (GP), pp. 429–443.
FPCA-1995-CousotC #abstract interpretation #constraints #formal method #program analysis: Formal Language, Grammar and Set-Constraint-Based Program Analysis by Abstract Interpretation (PC, RC), pp. 170–181.
FPCA-1995-JeuringS #analysis #functional #problem #source code: Constructing Functional Programs for Grammar Analysis Problems (JJ, SDS), pp. 259–269.
PLILP-1995-Marriott #constraints #multi #parsing #visual notation: Parsing Visual Languages with Constraint Multiset Grammars (KM), pp. 24–25.
SAC-1995-Cheung #ambiguity #context-free grammar: Ambiguity in context-free grammars (BSNC), pp. 272–276.
ESEC-1995-SchurrWZ #grammarware #graph grammar: Graph Grammar Engineering with PROGRES (AS, AJW, AZ), pp. 219–234.
ILPS-1995-TarauDF #backtracking #continuation #linear: Backtrackable State with Linear Assumptions, Continuations and Hidden Accumulator Grammars (PT, VD, AF), p. 642.
DAC-1994-BaldwinC #design #graph grammar #using: Design Methodology Management Using Graph Grammars (RAB, MJC), pp. 472–478.
ESOP-1994-JeuringS #analysis #bottom-up #functional: Bottom-up Grammar Analysis — A Functional Formulation (JJ, SDS), pp. 317–332.
TAGT-1994-CorradiniELMP #category theory #graph grammar: The Category of Typed Graph Grammars and its Adjunctions with Categories (AC, HE, ML, UM, JP), pp. 56–74.
TAGT-1994-CorradiniELMR #graph grammar #parallel #semantics: An Event Structure Semantics for Graph Grammars with Parallel Productions (AC, HE, ML, UM, FR), pp. 240–256.
TAGT-1994-CorradiniR #composition #graph grammar: Synchronized Composition of Graph Grammar Productions (AC, FR), pp. 257–270.
TAGT-1994-DerkD #configuration management #fault tolerance #graph grammar #parallel: Reconfiguration Graph Grammar for Massively Parallel, Fault Tolerant Computers (MDD, LSD), pp. 185–195.
TAGT-1994-KimJ #generative: HRNCE Grammars — A Hypergraph Generating System with an eNCE Way (CK, TEJ), pp. 383–396.
TAGT-1994-KorffR #graph grammar #petri net: Formal Relationship between Graph Grammars and Petri Nets (MK, LR), pp. 288–303.
TAGT-1994-NaglS #graph grammar #integration #problem #specification: Software Integration Problems and Coupling of Graph Grammar Specifications (MN, AS), pp. 155–169.
TAGT-1994-Parisi-Presicce #graph grammar: Transformations of Graph Grammars (FPP), pp. 428–442.
TAGT-1994-SkodinisW #bound #graph grammar #problem: The Bounded Degree Problem for Non-Obstructing eNCE Graph Grammars (KS, EW), pp. 211–224.
TAGT-1994-ZinssmeisterM #graph #graph grammar: Drawing Graphs with Attribute Graph Grammars (GZ, CM), pp. 443–453.
ICML-1994-AbeM #predict #probability: A New Method for Predicting Protein Secondary Structures Based on Stochastic Tree Grammars (NA, HM), pp. 3–11.
KR-1994-BaalenF #representation: The Role of Reversible Grammars in Translating Between Representation Languages (JVB, RF), pp. 562–571.
LOPSTR-1994-TarauD #continuation #first-order #logic programming: Logic Programming and Logic Grammars with First-Order Continuations (PT, VD), pp. 215–230.
SAC-1994-LiB #object-oriented #parsing #unification: An integrated parsing scheme for unification categorial grammar with object-oriented lexicon (LL, BRB), pp. 524–528.
CC-1994-Hedin #attribute grammar #bibliography: An Overview of Door Attribute Grammars (GH), pp. 31–51.
CC-1994-RousselPJ #attribute grammar: Coupling Evaluators for Attribute Coupled Grammars (GR, DP, MJ), pp. 52–67.
CC-1994-UhlH #analysis: Flow Grammars — a Flow Analysis Methodology (JSU, RNH), pp. 203–217.
CADE-1994-Salzer #unification: Primal Grammars and Unification Modulo a Binary Clause (GS), pp. 282–295.
DAC-1993-MandayamV #attribute grammar #performance #specification #using: Performance Specification Using Attributed Grammars (RM, RV), pp. 661–667.
ICDAR-1993-Conway #approach #documentation #layout #parsing #recognition: Page grammars and page parsing. A syntactic approach to document layout recognition (AC), pp. 761–764.
DLT-1993-DrewesHKT #generative #self: Generating Self-Affine Fractals by Collage Grammars (FD, AH, HJK, ST), pp. 278–289.
DLT-1993-EhrenfeuchtHPR #context-free grammar: An Introduction to Context-free Text Grammars (AE, HJH, PtP, GR), pp. 357–369.
DLT-1993-Georgescu #context-free grammar #on the: On the Index of Pure Context-free Grammars and Languages (GG), pp. 60–69.
DLT-1993-Istrate #equivalence: The Strong Equivalence of ETOL Grammars (GI), pp. 81–89.
DLT-1993-Marcus: Hidden Grammars (SM), pp. 453–460.
DLT-1993-Mihalache: Programmed Grammar Systems (VM), pp. 430–437.
DLT-1993-PaunRS: Contextual Grammars: Erasing, Determinism, One-Side Contexts (GP, GR, AS), pp. 370–388.
DLT-1993-Roder #graph grammar #parallel: Parallel BNLC Graph Grammars (HJR), pp. 438–449.
PLILP-1993-JourdanBPR #attribute grammar #implementation #specification #using: Specification and Implementation of Grammar Couplings using Attribute Grammars (MJ, CLB, DP, GR), pp. 123–136.
ICLP-1993-HuitouzeLR #logic #prolog: Logic Grammars and λ-Prolog (SLH, PL, OR), pp. 64–79.
ILPS-1993-Felty #definite clause grammar #higher-order #parsing #syntax: Definite Clause Grammars for Parsing Higher-Order Syntax (APF), p. 668.
PODS-1992-Dong #datalog #query #tool support: Datalog Expressiveness of Chain Queries: Grammar Tools and Characterizations (GD), pp. 81–90.
WSA-1992-Kuiper #attribute grammar #detection #parallel: Speeding Up Parallelism Detection for Attribute Grammars (MFK), pp. 152–162.
ICALP-1992-Engelfriet #graph grammar #normalisation: A Greibach Normal Form for Context-free Graph Grammars (JE), pp. 138–149.
PLILP-1992-Rosendahl #analysis #attribute grammar #strict: Strictness Analysis for Attribute Grammars (MR), pp. 145–157.
PLILP-1992-SaidiB #debugging #two-level grammar: Checking and Debugging of Two-level Grammars (SS, JFB), pp. 158–171.
PLILP-1992-Vilo #attribute grammar #implementation #modelling: Implementing Attribute Grammars by Computational Models (JV), pp. 485–486.
POPL-1992-FarrowMY #attribute grammar #composition #design #implementation: Composable Attribute Grammars: Support for Modularity in Translator Design and Implementation (RF, TJM, DMY), pp. 223–234.
CC-1992-Baum #attribute grammar #composition: Another Kind of Modular Attribute Grammars (BB), pp. 44–50.
CC-1992-GyimothyAS #attribute grammar: Integrated Graphics Environment to Develop Applications Based on Attribute Grammars (TG, ZA, RS), pp. 51–58.
CADE-1992-McAllester: Grammar Rewriting (DAM), pp. 124–138.
JICSLP-1992-HaasJ #definite clause grammar #interactive #synthesis: Interactive Synthesis of Definite-Clause Grammars (JH, BJ), pp. 541–555.
PLILP-1991-KosterB #on the #source code: On the Borderline Between Grammars and Programs (CHAK, JB), pp. 219–230.
PLILP-1991-Paakki #attribute grammar #logic programming #named: PROFIT: A System Integrating Logic Programming and Attribute Grammars (JP), pp. 243–254.
PLILP-1991-VogtSK #attribute grammar #evaluation #higher-order #incremental #performance: Efficient Incremental Evaluation of Higher order Attribute Grammars (HV, SDS, MFK), pp. 231–242.
RTA-1991-Brandenburg #bound #confluence #equivalence #graph grammar: The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree (FJB), pp. 312–322.
ESOP-1990-JourdanP #analysis: Techniques for Improving Grammar Flow Analysis (MJ, DP), pp. 240–255.
PLDI-1990-JourdanPJDB #attribute grammar #design #evaluation #implementation: Design, Implementation and Evaluation of the FNC-2 Attribute Grammar System (MJ, DP, CJ, OD, CLB), pp. 209–222.
PLDI-1990-TeitelbaumC #attribute grammar #editing #higher-order: Higher-Order Attribute Grammars and Editing Environments (TT, RC), pp. 197–208.
GG-1990-Barthelmann #category theory #graph grammar: Describing Göttler’s Operational Graph Grammars with Pushouts (KB), pp. 98–112.
GG-1990-Boer #biology #graph grammar #modelling: Graph Grammars as a Modelling Tool in Developmental Biology (MJMdB), pp. 41–43.
GG-1990-Brandenburg #approach #graph grammar #layout: Layout Graph Grammars: The Placement Approach (FJB), pp. 144–156.
GG-1990-Bunke #graph grammar #pattern matching #pattern recognition #question #recognition: Graph Grammars — a Useful Tool for Pattern Recognition? (HB), pp. 43–46.
GG-1990-BunkeGT #algorithm #graph grammar #implementation #performance: An Efficient Implementation of Graph Grammars Based on the RETE Matching Algorithm (HB, TG, THT), pp. 174–189.
GG-1990-Caucal #graph grammar: An Application of Graph Grammars to the Elimination of Redundancy from Functions Defined by Schemes (DC), pp. 190–206.
GG-1990-CorradiniMREL #graph grammar #logic programming: Graph Grammars and Logic Programming (AC, UM, FR, HE, ML), pp. 221–237.
GG-1990-CourcelleER #graph grammar: Context-free Handle-rewriting Hypergraph Grammars (BC, JE, GR), pp. 253–268.
GG-1990-Cuny #graph grammar #question #tool support: Graph Grammars as Tools in Applications Work? (JEC), pp. 46–47.
GG-1990-EhrigHKP #graph grammar: From Graph Grammars to High Level Replacement Systems (HE, AH, HJK, FPP), pp. 269–291.
GG-1990-EhrigKL #algebra #approach #category theory #graph grammar #tutorial: Tutorial Introduction to the Algebraic Approach of Graph Grammars Based on Double and Single Pushouts (HE, MK, ML), pp. 24–37.
GG-1990-EhringP #algebra #graph grammar #specification: Algebraic Specification Grammars: A Junction between Module Specifications and Graph Grammars (HE, FPP), pp. 292–310.
GG-1990-EngelfrietH #generative #graph grammar #power of: The Term Generating Power of Context-Free Hypergraph Grammars (JE, LH), pp. 328–243.
GG-1990-EngelfrietR #graph grammar: Graph Grammars Based on Node Rewriting: An Introduction to NLC Graph Grammars (JE, GR), pp. 12–23.
GG-1990-Gottler #graph grammar: Usefulness of Graph Grammars in Applications (HG), pp. 48–49.
GG-1990-GottlerGN #design #exclamation #graph grammar: Use Graph Grammars to Design CAD-Systems! (HG, JG, GN), pp. 396–410.
GG-1990-HabelK: Collage Grammars (AH, HJK), pp. 411–429.
GG-1990-Himsolt #graph grammar #interactive #named: GraphEd: An Interactive Tool For Developing Graph Grammars (MH), pp. 61–65.
GG-1990-JanssensR #graph: Structured Transformations and Computation Graphs for Actor Grammars (DJ, GR), pp. 446–460.
GG-1990-Kaplan #graph grammar #re-engineering: Applying Graph Grammars to Software engineering (SMK), pp. 49–51.
GG-1990-KaplanLG #concurrent #specification: Specifying Concurrent Languages and Systems with ???-Grammars (SMK, JPL, SKG), pp. 475–489.
GG-1990-Korff #graph grammar #rule-based: Application of Graph Grammars to Rule-Based Systems (MK), pp. 505–519.
GG-1990-Mayoh #graph grammar #information management #representation: Graph Grammars for Knowledge Representation (BHM), p. 53.
GG-1990-Nagl #graph grammar: Graph Grammars which are Suitable for Applications (MN), pp. 54–56.
GG-1990-NaglS #graph grammar #specification: A Specification Environment for Graph Grammars (MN, AS), pp. 599–609.
GG-1990-Paz #graph grammar: Usefulness and Visibility of Graph Grammars (AP), p. 56.
GG-1990-Schurr90b #graph grammar #named: PROGRESS: A VHL-Language Based on Graph Grammars (AS), pp. 641–659.
GG-1990-Sleep #graph grammar #research: Applications of Graph Grammars and Directions for Research (MRS), pp. 57–60.
GG-1990-TaentzerS #graph grammar: Movement of Objects in Configuration Spaces modelled by graph Grammars (GT, HS), pp. 660–675.
GG-1990-Wanke #graph grammar #named #tool support: PLEXUS: Tools for Analyzing Graph Grammars (EW), pp. 68–69.
ML-1990-Lehman #learning: A General Method for Learning Idiosyncratic Grammars (JFL), pp. 368–376.
WAGA-1990-AkkerMT #attribute grammar: The Hierarchy of LR-Attributed Grammars (RodA, BM, JT), pp. 13–28.
WAGA-1990-AlexinGHF #attribute grammar #comprehension #interface #natural language #specification: Attribute Grammar Specification for a Natural Language Understanding Interface (ZA, TG, TH, KF), pp. 313–326.
WAGA-1990-DelestF #attribute grammar #using: Counting Polyominoes Using Attribute Grammars (MPD, JMF), pp. 46–60.
WAGA-1990-Eijk #attribute grammar #prototype #tool support: Attribute Grammar Applications in Prototyping LOTOS Tools (PvE), pp. 91–100.
WAGA-1990-JourdanBP #attribute grammar #design #evaluation #implementation: The OLGA Attribute Grammar Description Language: Design, Implementation and Evaluation (MJ, CLB, DP), pp. 222–237.
WAGA-1990-JulieP #attribute grammar #optimisation: Space Optimization in the FNC-2 Attribute Grammar System (CJ, DP), pp. 29–45.
WAGA-1990-Knuth #attribute grammar: The Genesis of Attribute Grammars (DEK), pp. 1–12.
WAGA-1990-Levison #attribute grammar #generative #natural language: Gregory Lessard: Application of Attribute Grammars to Natural Language Sentence Generation (ML), pp. 298–312.
WAGA-1990-Meijer #affix grammar: The Project on Extended Affix Grammars at Nijmegen (HM), pp. 130–142.
WAGA-1990-Peckham #attribute grammar: Globally Partitionable Attribute Grammars (SBP), pp. 327–342.
WAGA-1990-Rosendahl #abstract interpretation #attribute grammar #using: Abstract Interpretation Using Attribute Grammar (MR), pp. 143–156.
WAGA-1990-ShinodaK #algorithm #attribute grammar #distributed #evaluation #implementation #object-oriented #using: Object-Oriented Extension of Attribute Grammars and its Implementation Using Distributed Attribute Evaluation Algorithm (YS, TK), pp. 177–191.
WAGA-1990-VogtBF #agile #attribute grammar #development #program transformation: Rapid Development of a Program Transformation System with Attribute Grammars and Dynamic Transformations (HV, AvdB, AF), pp. 101–115.
WAGA-1990-Waite #attribute grammar #compilation: Use of Attribute Grammars in Compiler Construction (WMW), pp. 255–265.
WAGA-1990-Wilhelm #attribute grammar #functional: Tree Tranformations, Functional Languages, and Attribute Grammars (RW), pp. 116–129.
CC-1990-JourdanP #attribute grammar #development: Application Development with the FNC-2 Attribute Grammar System (MJ, DP), pp. 11–25.
CC-1990-LammelF #attribute grammar: Mixed Dialogue Control Defined by an Attribute Grammar (Abstract) (UL, PF), pp. 219–221.
CLP-1990-Paakki90 #attribute grammar #compilation: A Logic-Based Modification of Attribute Grammars for Practical Compiler Writing (JP), pp. 203–217.
CLP-1990-PareschiM90 #definite clause grammar: Extending Definite Clause Grammars with Scoping Constructs (RP, DM), pp. 373–389.
DAC-1989-BamjiA #grammarware #named #parsing: GRASP: A Grammar-based Schematic Parser (CB, JA), pp. 448–453.
SIGMOD-1989-GyssensPG #approach #grammarware #modelling #towards: A Grammar-Based Approach Towards Unifying Hierarchical Data Models (Extended Abstract) (MG, JP, DVG), pp. 263–272.
PLDI-1989-FarrowS #attribute grammar #compilation: A VHDL Compiler Based on Attribute Grammar Methodology (RF, AGS), pp. 120–130.
PLDI-1989-VogtSK #attribute grammar #higher-order: Higher-Order Attribute Grammars (HV, SDS, MFK), pp. 131–145.
ICALP-1989-Parisi-Presicce #composition #design #graph grammar: Modular System Design Applying Graph Grammars Techniques (FPP), pp. 621–636.
CHI-1989-Zanden #constraints #specification #visual notation: Constraint grammars-a new model for specifying graphical applications (BTVZ), pp. 325–330.
ECOOP-1989-Hedin #attribute grammar #object-oriented: An Object-Oriented Notation for Attribute Grammars (GH), pp. 329–345.
POPL-1989-SagivEFR #analysis #attribute grammar #data flow: Resolving Circularity in Attribute Grammars with Applications to Data Flow Analysis (SS, OE, NF, MR), pp. 36–48.
ESEC-1989-Gottler #graph grammar #implementation #paradigm #visual notation: Graph Grammars, a new Paradigm for Implementing Visual Languages (HG), pp. 336–350.
NACLP-1989-Chau #comparison #logic: Narrowing Grammar: A Comparison with Other Logic Grammars (HLC), pp. 735–754.
NACLP-1989-Searls #definite clause grammar: Investigating the Linguistics of DNA with Definite Clause Grammars (DBS), pp. 189–208.
RTA-1989-Gottler #graph grammar #implementation #visual notation: Graph Grammars, A New Paradigma for Implementing Visual Languages (HG), pp. 152–166.
SIGMOD-1988-Lohman #functional #optimisation #query #representation: Grammar-like Functional Rules for Representing Query Optimization Alternatives (GML), pp. 18–27.
PLDI-1988-WalzJ #attribute grammar #evaluation #incremental: Incremental Evaluation for a General Class of Circular Attribute Grammars (JAW, GFJ), pp. 209–221.
ICALP-1988-Lautemann #algorithm #graph grammar #performance: Efficient Algorithms on Context-Free Graph Grammars (CL), pp. 362–378.
ICALP-1988-Niemi: Maximal Dense Intervals of Grammar Forms (VN), pp. 424–438.
PLILP-1988-Attali #attribute grammar #compilation: Compiling TYPOL with Attribute Grammars (IA), pp. 252–272.
PLILP-1988-Christiansen #attribute grammar: Structure Sharing in Attribute Grammars (HC), pp. 180–200.
PLILP-1988-Dang #definite clause grammar #interactive #specification #using: Formal Specification of Interactive Languages Using Definite Clause Grammars (WD), pp. 283–291.
PLILP-1988-RiedewaldL #attribute grammar #logic programming #using: Using an Attribute Grammar as a Logic Program (GR, UL), pp. 161–179.
PLILP-1988-YamashitaN #paradigm #programming: Coupled Contex-Free Grammar As a Programming Paradigm (YY, IN), pp. 132–145.
JICSCP-1988-Abramson88 #approach #aspect-oriented #definite clause grammar #metaprogramming: Metarules and an Approach to Conjunction in Definite Clause Translation Grammars: Some Aspects of Grammatical Metaprogramming (HA), pp. 233–248.
JICSCP-1988-Hemmendinger88 #compilation #semantics: A Compiler and Semantic Analyzer Based on Categorial Grammar (DH), pp. 1474–1489.
VLDB-1987-GonnetT #approach #modelling: Mind Your Grammar: a New Approach to Modelling Text (GHG, FWT), pp. 339–346.
FPCA-1987-Johnsson #attribute grammar #functional #paradigm #programming: Attribute grammars as a functional programming paradigm (TJ), pp. 154–173.
ICLP-1987-Pereira87 #logic: Grammars and Logics of Partial Information (FCNP), pp. 989–1013.
GG-1986-BaileyC #grammarware #graph grammar #parallel #specification: Graph Grammar Based Specification of Interconnection Structures for Massively Parallel Computation (DAB, JEC), pp. 73–85.
GG-1986-BoehmEHL #distributed #graph grammar #towards: Towards distributed graph grammars (PB, HE, UH, ML), pp. 86–98.
GG-1986-Brandenburg #graph grammar #on the #order: On Partially Ordered Graph Grammars (FJB), pp. 99–111.
GG-1986-CarlyleGP #complexity #generative #parallel: Complexity of pattern generation via planar parallel binary fission/fusion grammars (JWC, SAG, AP), pp. 515–533.
GG-1986-Ehrig #algebra #approach #graph grammar #tutorial: Tutorial introduction to the algebraic approach of graph grammars (HE), pp. 3–14.
GG-1986-EngelfrietLR #graph grammar: Apex Graph Grammars (JE, GL, GR), pp. 167–185.
GG-1986-EngelsLS #grammarware #graph grammar #specification: Graph Grammar Engineering: A Software Specification Method (GE, CL, WS), pp. 186–201.
GG-1986-Gottler #diagrams #editing #graph grammar: Graph grammars and diagram editing (HG), pp. 216–231.
GG-1986-HessM: Graphics and Their Grammars (LH, BHM), pp. 232–249.
GG-1986-Jackel #graph grammar: ADA-Concurrency specified by Graph Grammars (MJ), pp. 262–279.
GG-1986-JanssensR #graph grammar: Basic notions of actor grammars: A graph grammar model for actor computation (DJ, GR), pp. 280–298.
GG-1986-Jeffs #graph grammar #independence: Embedding Rule Independent Theory of Graph Grammars (JJ), pp. 299–308.
GG-1986-KaplanGC #development #graph grammar #process: Supporting the Software Development Process with Attributed NLC Graph Grammars (SMK, SKG, RHC), pp. 309–325.
GG-1986-Kaul #graph grammar #precedence: Practical Applications of Precedence Graph Grammars (MK), pp. 326–342.
GG-1986-Kreowski #concurrent #graph grammar #parallel: Is parallelism already concurrency? Part 1: Derivations in graph grammars (HJK), pp. 343–360.
GG-1986-KreowskiW #concurrent #graph grammar #parallel #process: Is parallelism already concurrency? Part 2: Non-sequential processes in graph grammars (HJK, AW), pp. 361–377.
GG-1986-MainR #graph grammar: Fundamentals of edge-label controlled graph grammars (MGM, GR), pp. 411–426.
GG-1986-MoldovanP #analysis #graph grammar #parallel #rule-based #using: Parallelism analysis in rule-based systems using graph grammars (DIM, FPP), pp. 427–439.
GG-1986-Nagl #graph grammar #set: Set theoretic approaches to graph grammars (MN), pp. 41–54.
GG-1986-Rosenfeld #array: Array Grammars (AR), pp. 67–70.
GG-1986-SiromoneyS: Rosenfeld’s cycle grammars and kolam (GS, RS), pp. 564–579.
GG-1986-Wankmuller #graph grammar #music: Application of Graph Grammars in Music Composing Systems (FW), pp. 580–592.
GG-1986-Welzl #bound #graph grammar: Boundary NlC and partition controlled graph grammars (EW), pp. 593–609.
POPL-1986-Hoover #attribute grammar: Dynamically Bypassing Copy Rule Chains in Attribute Grammars (RH), pp. 14–25.
POPL-1986-JonesS #attribute grammar #design: Hierarchical VLSI Design Systems Based on Attribute Grammars (LGJ, JS), pp. 58–69.
ICLP-1986-Abramson86 #concurrent #logic: Sequential and Concurrent Deterministic Logic Grammars (HA), pp. 389–395.
ICSE-1985-YellinM #attribute grammar: Two-Way Translators Based on Attribute Grammar Inversion (DMY, EMMM), pp. 36–42.
SCC-1984-Farrow #attribute grammar: Sub-protocol-evaluators for attribute grammars (RF), pp. 70–80.
SCC-1984-GanzingerG #attribute grammar: Attribute coupled grammars (HG, RG), pp. 157–170.
SCC-1984-Jourdan #attribute grammar #evaluation #recursion: Strongly non-circular attribute grammars and their recursive evaluation (MJ), pp. 81–93.
SCC-1984-JulligD #attribute grammar: Regular right-part attribute grammars (RJ, FD), pp. 171–178.
ICALP-1984-Welzl #encoding #formal method #graph #graph grammar: Encoding Graphs by Derivations and Implications for the Theory of Graph Grammars (EW), pp. 503–513.
POPL-1984-Wilhelm #attribute grammar: Inverse Currying Transformation on Attribute Grammars (RW), pp. 140–147.
ILPC-1984-Dahl84 #on the #semiparsing: On Gapping Grammars (VD), pp. 77–88.
SLP-1984-Abramson84 #definite clause grammar: Definite Clause Translation Grammars (HA), pp. 233–240.
PODS-1983-Kintala #attribute grammar #query: Attributed Grammars for Query Language Translations (CMRK), pp. 137–148.
ICALP-1983-Kamimura #attribute grammar #automaton: Tree Automata and Attribute Grammars (TK), pp. 374–384.
SIGIR-1983-Sopena #information management #natural language: Natural Language Grammars for an Information System (LDS), pp. 75–80.
SCC-1982-DrossopoulouUPGDW #ada #attribute grammar: An Attribute Grammar for Ada (SD, JSU, GP, GG, MD, GW), pp. 334–348.
SCC-1982-Farrow #attribute grammar #named: LINGUIST-86: Yet Another Translator Writing System Based On Attribute Grammars (RF), pp. 160–171.
SCC-1982-KoskimiesRS #attribute grammar #compilation #using: Compiler Construction Using Attribute Grammars (KK, KJR, MS), pp. 153–159.
ICALP-1982-Blum #context-free grammar #on the #power of: On the Power of Chain Rules in Context Free Grammars (NB), pp. 72–82.
ICALP-1982-Niwinski #algebra #fixpoint #semantics: Fixed-Point Semantics for Algebraic (Tree) Grammars (Extended Abstract) (DN), pp. 384–396.
GG-1982-Bartsch-Sporl #grammar inference #graph grammar #pattern matching #pattern recognition #recognition: Grammatical inference of graph grammars for syntactic pattern recognition (BBS), pp. 1–7.
GG-1982-Bunke #comprehension #generative #graph grammar #image: Graph Grammars as a generative tool in image understanding (HB), pp. 8–19.
GG-1982-CastellaniM #distributed #graph grammar: Graph Grammars for distributed systems (IC, UM), pp. 20–38.
GG-1982-Ehrig #aspect-oriented #concurrent #graph grammar: Aspects of concurrency in graph grammars (HE), pp. 58–81.
GG-1982-GenrichJRT #graph grammar #petri net: Petri nets and their relation to graph grammars (HJG, DJ, GR, PST), pp. 115–129.
GG-1982-Gottler #graph grammar: Attributed graph grammars for graphics (HG), pp. 130–142.
GG-1982-Hoffmann #compilation #generative #graph grammar #modelling: Modelling compiler generation by graph grammars (BH), pp. 159–171.
GG-1982-JanssensR82a #graph grammar: Graph grammars with node-label controlled rewriting and embedding (DJ, GR), pp. 186–205.
GG-1982-NagelEGS #graph grammar #specification: Software specification by graph grammars (MN, GE, RG, WS), pp. 267–287.
GG-1982-Nagl #bibliography #graph grammar #term rewriting: Bibliography on graph-rewriting systems (graph grammars) (MN), pp. 415–448.
GG-1982-Paz #geometry: Geometry versus topology in map grammars (AP), pp. 288–296.
GG-1982-SanfeliuF #graph grammar #pattern matching #pattern recognition #recognition: Tree graph grammars for pattern recognition (AS, KSF), pp. 349–368.
POPL-1982-Farrow #attribute grammar #compilation #experience #grammarware: Experience with an Attribute Grammar-Based Compiler (RF), pp. 95–107.
POPL-1982-GanapathiF #attribute grammar #code generation #using: Description-Driven Code Generation using Attribute Grammars (MG, CNF), pp. 108–119.
ILPC-1982-HirschmanP82 #prolog #strict: Restriction Grammar in Prolog (LH, KP), pp. 85–90.
ILPC-1982-MaluszynskiN82 #comparison #logic programming #programming language #prolog: A Comparison of the Logic Programming Language Prolog with Two-levels Grammars (JM, JFN), pp. 193–199.
POPL-1981-DemersRT #attribute grammar #editing #evaluation #incremental: Incremental Evaluation for Attribute Grammars with Application to Syntax-Directed Editors (AJD, TWR, TT), pp. 105–116.
POPL-1981-KatayamaH #attribute grammar #verification: Verification of Attribute Grammars (TK, YH), pp. 177–186.
ICSE-1981-DuncanH #attribute grammar #design #implementation #using: Using Attributed Grammars to Test Designs and Implementations (AGD, JSH), pp. 170–178.
ICSE-1981-Katayama #attribute grammar #functional #named #programming: HFP: A Hierarchical and Functional Programming Based on Attribute Grammar (TK), pp. 343–353.
ICALP-1980-EngelfrietF #attribute grammar #multi: Formal Properties of One-Visit and Multi-Pass Attribute Grammars (JE, GF), pp. 182–194.
ICALP-1980-Schlichtiger: Partitioned Chain Grammars (PS), pp. 555–568.
ICALP-1980-Schmidt #attribute grammar #strict: Space-Restricted Attribute Grammars (EMS), pp. 436–448.
POPL-1980-HuntR #algorithm #performance #similarity: Efficient Algorithms for Structural Similarity of Grammars (HBHI, DJR), pp. 213–219.
SDCG-1980-Ganzinger #attribute grammar #semantics: Transforming denotational semantics into practical attribute grammars (HG), pp. 1–69.
SDCG-1980-Madsen #attribute grammar #on the #semantics: On defining semantics by means of extended attribute grammars (OLM), pp. 259–299.
SDCG-1980-Meijer #affix grammar #implementation: An implementation of affix grammars (HM), pp. 320–349.
SDCG-1980-Tienari #attribute grammar #on the: On the definition of attribute grammar (MT), pp. 408–414.
SCC-1979-Raiha #attribute grammar #multi: Dynamic allocation of space for attribute instances in multi-pass evaluators of attribute grammars (KJR), pp. 26–38.
ICALP-1979-Blattner #product line: Inherent Ambiguities in Families of Grammars (Extended Abstract) (MB), pp. 38–48.
ICALP-1979-DembinskiM #equation #two-level grammar: Two Level Grammars: CF-Grammars with Equation Schemes (PD, JM), pp. 171–187.
ICALP-1979-Friede #ll: Partitioned LL(k) Grammars (DF), pp. 245–255.
ICALP-1979-MiltonF #attribute grammar #ll #parsing: LL(k) Parsing for Attributed Grammars (DRM, CNF), pp. 422–430.
ICALP-1979-Nijholt #recursion: Structure Preserving Transformations on Non-Left-Recursive Grammars (Preliminary Version) (AN), pp. 446–459.
ICALP-1979-Wegner #approach #decidability #two-level grammar: Bracketed Two-Level Grammars — A Decidable and Practical Approach to Language Definitions (LMW), pp. 668–682.
POPL-1979-CohenH #attribute grammar #automation #generative: Automatic Generation of Near-Optimal Translators for Noncircular Attribute Grammars (RSC, EH), pp. 121–134.
ICSE-1979-BauerF #generative #testing #using: Test Plan Generation Using Formal Grammars (JAB, ABF), pp. 425–432.
ICALP-1978-Barth #set: Grammars with Dynamic Control Sets (GB), pp. 36–51.
ICALP-1978-Nijholt #on the #parsing: On the Parsing and Covering of Simple Chain Grammars (AN), pp. 330–344.
ICALP-1978-Saarinen #attribute grammar #on the #performance: On Constructing Efficient Evaluators for Attribute Grammars (MS), pp. 382–397.
GG-1978-Bunke #graph grammar: Programmed Graph Grammars (HB), pp. 155–166.
GG-1978-CatalanoGM #algebra #framework #problem: Shortest Path Problems and Tree Grammars: An Algebraic Framework (AC, SG, UM), pp. 167–179.
GG-1978-Ehrig #algebra #bibliography #graph grammar: Introduction to the Algebraic Theory of Graph Grammars (A Survey) (HE), pp. 1–69.
GG-1978-EhrigL #graph grammar #parallel: Locally Star Sluing Formulas for a Class of Parallel Graph Grammars (HE, AL), pp. 206–223.
GG-1978-EhrigR #composition #graph grammar: Decomposition of Graph Grammar Productions and Derivations (HE, BKR), pp. 192–205.
GG-1978-Hesse #graph grammar: Two-Level Graph Grammars (WH), pp. 255–269.
GG-1978-Nagl #bibliography #graph grammar #tutorial: A Tutorial and Bibliographical Survey on Graph Grammars (MN), pp. 70–126.
GG-1978-NyrupM #algebra #approach: Map Grammars: Cycles and the Algebraic Approach (KN, BHM), pp. 331–340.
GG-1978-Ollongren #graph grammar #multi #on the: On Multilevel-Graph Grammars (AO), pp. 341–349.
GG-1978-Padawitz #graph grammar #semantics: Graph Grammars and Operational Semantics (PP), pp. 350–366.
GG-1978-Pfaltz #2d #graph grammar #network #set: A Graph Grammar that Describes the Set of Two-Dimensional Surface Networks (JLP), pp. 379–388.
GG-1978-Pratt #graph #programming language #semantics #using: Definition of Programming Language Semantics Using Grammars for Hierarchical Graphs (TWP), pp. 389–400.
GG-1978-Wileden #analysis #concurrent #design #graph grammar: Relationships Between Graph Grammars and the Design and Analysis of Concurrent Software (JCW), pp. 456–463.
ICALP-1977-Brandenburg #bound #context-sensitive grammar: The Contextsensitivity Bounds of Contextsensitive Grammars and Languages (FJB), pp. 120–134.
ICALP-1977-Dieterich #context-free grammar #fault #parsing: Parsing and Syntactic Error Recovery for Context-Free Grammars by Means of Coarse Structures (EWD), pp. 180–192.
ICALP-1977-Engelfriet #metaprogramming: Macro Grammars, Lindenmayer Systems and Other Copying Devices (JE), pp. 221–229.
ICALP-1977-Monien: About the Derivation Languages of Grammars and Machines (BM), pp. 337–351.
ICALP-1977-Nijholt: Simple Chain Grammars (AN), pp. 352–364.
ICALP-1977-Rajlich #data type #graph grammar #relational: Theory of Data Structures by Relational and Graph Grammars (VR), pp. 391–411.
ICALP-1977-Walter #context-free grammar #decidability #equivalence: Structural Equivalence of Context-Free Grammar Forms is Decidable (HKGW), pp. 539–553.
POPL-1977-KennedyZ #analysis #control flow #graph grammar: Applications of Graph Grammar for Program Control Flow Analysis (KK, LZ), pp. 72–85.
POPL-1977-Nijholt #on the #recursion: On the Covering of Left Recursive Grammars (AN), pp. 86–96.
POPL-1976-Franck #2d #analysis #graph grammar #named #precedence: PLAN2D — Syntactic Analysis of Precedence Graph Grammars (RF), pp. 134–139.
POPL-1976-Hunt #complexity #problem: A Complexity Theory of Grammar Problems (HBHI), pp. 12–18.
POPL-1976-KennedyW #attribute grammar #automation #generative #performance: Automatic Generation of Efficient Evaluators for Attribute Grammars (KK, SKW), pp. 32–49.
STOC-1975-GinsburgL #comparative #complexity: Comparative Complexity of Grammar Forms (SG, NAL), pp. 153–158.
STOC-1975-HuntS #complexity #on the #problem: On the Complexity of Grammar and Related Problems (HBHI, TGS), pp. 54–65.
POPL-1975-JazayeriOR #attribute grammar #complexity #on the: On the Complexity of the Circularity Test for Attribute Grammars (MJ, WFO, WCR), pp. 119–129.
SIGFIDET-1974-LiuH #grammarware: A Record Oriented, Grammar Driven Data Translation Model (SL, JH), pp. 171–189.
STOC-1974-Greibach #strict: Some Restrictions on W-Grammars (SAG), pp. 256–265.
ICALP-1974-Bertsch #decidability: A Decidability Result for Sequential Grammars (EB), pp. 577–583.
ICALP-1974-CremersG #context-free grammar: Context-Free Grammar Forms (ABC, SG), pp. 364–382.
ICALP-1974-ShamirB: Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages (ES, CB), pp. 27–33.
ICALP-1974-Wijngaarden #generative #power of #two-level grammar: The Generative Power of Two-Level Grammars (AvW), pp. 9–16.
POPL-1973-AhoJU #ambiguity #parsing: Deterministic Parsing of Ambiguous Grammars (AVA, SCJ, JDU), pp. 1–21.
ICALP-1972-Baker #context-free grammar #context-sensitive grammar #generative: Context-Sensitive Grammars Generating Context-Free Languages (BSB), pp. 501–506.
ICALP-1972-HarrisonH #on the #product line: On a Family of Deterministic Grammars (Extended Abstract) (MAH, IMH), pp. 413–441.
STOC-1971-AhoU #lr: The Care and Feeding of LR(k) Grammars (AVA, JDU), pp. 159–170.
STOC-1971-Buttelmann #automaton #finite #generative #on the #strict: On Generalized Finite Automata and Unrestricted Generative Grammars (HWB), pp. 63–77.
STOC-1971-Rajlich #finite #parallel #transducer: Absolutely Parallel Grammars and Two-Way Deterministic Finite-State Transducers (VR), pp. 132–137.
STOC-1971-Terrine #algorithm #bottom-up #context-free grammar #generative #parsing #set: An Algorithm Generating the Decision Table of a Deterministic Bottom Up Parser for a Subset of Context Free Grammars (GT), pp. 185–205.
STOC-1971-Wise #algorithm: Domolki’s Algorithm Applied to Generalized Overlap Resolvable Grammars (DSW), pp. 171–184.
STOC-1970-Chang #2d #analysis #using: The Analysis of Two-Dimensional Patterns using Picture Processing Grammars (SKC), pp. 206–216.
STOC-1970-Cudia #decidability #problem: The Degree Hierarchy of Undecidable Problems of Formal Grammars (DFC), pp. 10–21.
STOC-1969-AhoU #context-free grammar: Translations on a Context Free Grammar (AVA, JDU), pp. 93–112.
STOC-1969-RosenkrantzS #top-down: Properties of Deterministic Top Down Grammars (DJR, RES), pp. 165–180.
STOC-1969-Rounds #context-free grammar: Context-Free Grammars on Trees (WCR), pp. 143–148.