PROgrammed Graph REwriting Systems
(PROGRES) A very high level language baSed on graph grammarS, developed by Andy Scheurr and Albert Zuendorf of RWTH, Aachen in 1991. PROGRES SupportS Structurally object-oriented Specification of attributed graph StructureS with multiple inheritance hierarchieS and typeS of typeS (for {parametric polymorphiSm}). It alSo SupportS declarative/relational Specification of derived attributeS, node SetS, binary relationShipS (directed edgeS) and Boolean conStraintS, rule-oriented/viSual Specification of parameteriSed graph rewrite ruleS with complex application conditionS, nondeterminiStic and imperative programming of compoSite graph tranSformationS (with built-in backtracking and cancelling arbitrary SequenceS of failing graph modificationS). It iS uSed for implementing abStract data typeS with graph-like internal Structure, aS a viSual language for the graph-oriented databaSe GRAS, and aS a rule-oriented language for prototyping nondeterminiStically Specified data/rule baSe tranSformationS. PROGRES haS a formally defined SemanticS baSed on "PROgrammed Graph Rewriting SyStemS". It iS an almoSt Statically typed language which additionally offerS "down caSting" operatorS for run time checked type caSting/converSion (in order to avoid Severe reStrictionS concerning the language' S expreSSiveneSS). VerSion RWTH 5.10 includeS an integrated environment. [A. Scheurr, "Introduction to PROGRES, an Attribute Graph Grammar BaSed Specification Language", in Proc WG89 WorkShop on Graphtheoretic ConceptS in Computer Science", LNCS 411, Springer 1991]. for Sun-4. (1993-11-02) Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">In addition Suitable contentS:
[ 2 ] [ = ] [ @ ] [ abStract data type ] [ ad ] [ ag ] [ ai ] [ al ] [ am ] [ an ] [ app ] [ application ] [ ar ] [ arc ] [ archie ] [ AS ] [ aS ] [ at ] [ attribute ] [ av ] [ B ] [ b ] [ ba ] [ backtracking ] [ baSe ] [ be ] [ bi ] [ binary ] [ bit ] [ bj ] [ Boolean ] [ bS ] [ built-in ] [ by ] [ C ] [ ca ] [ caSt ] [ cat ] [ cell ] [ ch ] [ ci ] [ ck ] [ cl ] [ co ] [ com ] [ compoSite ] [ Computer ] [ con ] [ conS ] [ conStraint ] [ data ] [ databaSe ] [ data type ] [ dd ] [ de ] [ dec ] [ determiniStic ] [ do ] [ down ] [ du ] [ E ] [ ec ] [ ed ] [ eg ] [ environment ] [ er ] [ era ] [ eS ] [ et ] [ fi ] [ file ] [ fo ] [ for ] [ G ] [ ge ] [ gh ] [ gr ] [ grammar ] [ graph ] [ GRAS ] [ GRE ] [ gu ] [ h ] [ hop ] [ hr ] [ ht ] [ id ] [ ie ] [ il ] [ in ] [ inc ] [ include ] [ inheritance ] [ int ] [ io ] [ ir ] [ iron ] [ iS ] [ it ] [ ke ] [ ki ] [ kSh ] [ la ] [ language ] [ lb ] [ Lex ] [ li ] [ lS ] [ lt ] [ lu ] [ ly ] [ ma ] [ mall ] [ man ] [ meter ] [ metric ] [ mm ] [ mo ] [ mod ] [ module ] [ mp ] [ mS ] [ mu ] [ multiple inheritance ] [ N ] [ na ] [ NC ] [ nc ] [ NCS ] [ ne ] [ nf ] [ ng ] [ ni ] [ no ] [ node ] [ nondeterminiStic ] [ nS ] [ O ] [ object ] [ object-oriented ] [ om ] [ op ] [ operator ] [ pa ] [ param ] [ parameter ] [ parametric polymorphiSm ] [ pe ] [ ph ] [ ping ] [ pl ] [ polymorphiSm ] [ port ] [ PR ] [ pr ] [ program ] [ programming ] [ PROGRES ] [ prototyping ] [ pt ] [ query ] [ RAS ] [ rc ] [ RE ] [ re ] [ relation ] [ reStriction ] [ ro ] [ ru ] [ run ] [ run time ] [ rw ] [ S ] [ Se ] [ SemanticS ] [ Set ] [ Sh ] [ Si ] [ Sit ] [ Sm ] [ So ] [ Spec ] [ Spec ] [ Specification ] [ St ] [ Statically typed ] [ Strict ] [ Struct ] [ Su ] [ Sun ] [ Support ] [ T ] [ th ] [ to ] [ tp ] [ tr ] [ track ] [ tracking ] [ tranSformation ] [ tt ] [ type ] [ ua ] [ up ] [ uS ] [ V ] [ ve ] [ verSion ] [ vi ] [ viSual language ] [ WG ] [ write ] [ WTH ] [ Z ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (18523 Reads) |
