| http://dbpedia.org/ontology/abstract
|
BURS (bottom-up rewrite system) theory tac … BURS (bottom-up rewrite system) theory tackles the problem of taking a complex expression tree or intermediate language term and finding a good translation to machine code for a particular architecture. Implementations of BURS often employ dynamic programming to solve this problem. BURS can also be applied to the problem of designing an instruction set for an application-specific instruction set processor.cation-specific instruction set processor.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
http://www.stratego-language.org/Transform/BURG +
|
| http://dbpedia.org/ontology/wikiPageID
|
3423275
|
| http://dbpedia.org/ontology/wikiPageLength
|
1438
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1098851662
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Architecture +
, http://dbpedia.org/resource/Machine_code +
, http://dbpedia.org/resource/Susan_L._Graham +
, http://dbpedia.org/resource/Application-specific_instruction_set_processor +
, http://dbpedia.org/resource/Intermediate_language +
, http://dbpedia.org/resource/Instruction_set +
, http://dbpedia.org/resource/Translation +
, http://dbpedia.org/resource/Dynamic_programming +
, http://dbpedia.org/resource/Category:Computer_languages +
, http://dbpedia.org/resource/Expression_%28programming%29 +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Compu-sci-stub +
, http://dbpedia.org/resource/Template:Orphan +
, http://dbpedia.org/resource/Template:About +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Computer_languages +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/BURS?oldid=1098851662&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/BURS +
|
| owl:sameAs |
http://dbpedia.org/resource/BURS +
, https://global.dbpedia.org/id/4UiDd +
, http://rdf.freebase.com/ns/m.09bq94 +
, http://yago-knowledge.org/resource/BURS +
, http://www.wikidata.org/entity/Q4836807 +
|
| rdf:type |
http://dbpedia.org/class/yago/WikicatComputerLanguages +
, http://dbpedia.org/class/yago/Communication100033020 +
, http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/class/yago/ArtificialLanguage106894544 +
, http://dbpedia.org/class/yago/ProgrammingLanguage106898352 +
, http://dbpedia.org/class/yago/Language106282651 +
, http://dbpedia.org/class/yago/ComputerLanguage106899633 +
|
| rdfs:comment |
BURS (bottom-up rewrite system) theory tac … BURS (bottom-up rewrite system) theory tackles the problem of taking a complex expression tree or intermediate language term and finding a good translation to machine code for a particular architecture. Implementations of BURS often employ dynamic programming to solve this problem. BURS can also be applied to the problem of designing an instruction set for an application-specific instruction set processor.cation-specific instruction set processor.
|
| rdfs:label |
BURS
|
