Bidirectional grammars for machine-code decoding and encoding

DOI10.1007/978-3-319-48869-1_6zbMATH Open1420.68104OpenAlexW2553216398MaRDI QIDQ5919617

Greg Morrisett, Gang Tan

Publication date: 16 September 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48869-1_6

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Coding by minimal linear grammars 👍 👎
• Bidirectional parsing for linear languages 👍 👎
• How to generate binary codes using context-free grammars 👍 👎
• Bidirectional cooperating distributed grammar systems 👍 👎
• HOW TO GENERATE BINARY CODES USING CONTEXT-FREE GRAMMARS 👍 👎
• Bidirectional grammars for machine-code decoding and encoding 👍 👎

This page was built for publication: Bidirectional grammars for machine-code decoding and encoding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919617)