eli.bendersky | d5ba345 | 2011-02-18 21:32:47 +0200 | [diff] [blame] | 1 | #----------------------------------------------------------------- |
| 2 | # pycparser: c-to-c.py |
| 3 | # |
eli.bendersky | afcfaac | 2011-02-25 16:46:01 +0200 | [diff] [blame] | 4 | # Example of a C code generator from pycparser AST nodes, serving |
| 5 | # as a simplistic translator from C to AST and back to C. |
eli.bendersky | b36f5bb | 2011-03-06 07:22:33 +0200 | [diff] [blame] | 6 | # Note: at this stage, the example is "alpha release" and considered |
| 7 | # experimental. Please file any bugs you find in the Issues page on pycparser's |
| 8 | # website. |
eli.bendersky | d5ba345 | 2011-02-18 21:32:47 +0200 | [diff] [blame] | 9 | # |
| 10 | # Copyright (C) 2008-2011, Eli Bendersky |
eli.bendersky | 84a6a63 | 2011-04-29 09:00:43 +0300 | [diff] [blame] | 11 | # License: BSD |
eli.bendersky | d5ba345 | 2011-02-18 21:32:47 +0200 | [diff] [blame] | 12 | #----------------------------------------------------------------- |
| 13 | from __future__ import print_function |
| 14 | import sys |
| 15 | |
| 16 | # This is not required if you've installed pycparser into |
| 17 | # your site-packages/ with setup.py |
| 18 | # |
| 19 | sys.path.insert(0, '..') |
| 20 | |
| 21 | from pycparser import c_parser, c_ast, parse_file |
| 22 | |
| 23 | |
eli.bendersky | afcfaac | 2011-02-25 16:46:01 +0200 | [diff] [blame] | 24 | class CGenerator(object): |
| 25 | """ Uses the same visitor pattern as c_ast.NodeVisitor, but modified to |
| 26 | return a value from each visit method, using string accumulation in |
| 27 | generic_visit. |
| 28 | """ |
eli.bendersky | d5ba345 | 2011-02-18 21:32:47 +0200 | [diff] [blame] | 29 | def __init__(self): |
| 30 | self.output = '' |
| 31 | |
eli.bendersky | 3ae9f7a | 2011-02-27 07:19:41 +0200 | [diff] [blame] | 32 | # Statements start with indentation of self.indent_level spaces, using |
| 33 | # the _make_indent method |
eli.bendersky | afcfaac | 2011-02-25 16:46:01 +0200 | [diff] [blame] | 34 | # |
| 35 | self.indent_level = 0 |
| 36 | |
eli.bendersky | 3ae9f7a | 2011-02-27 07:19:41 +0200 | [diff] [blame] | 37 | def _make_indent(self): |
| 38 | return ' ' * self.indent_level |
| 39 | |
eli.bendersky | afcfaac | 2011-02-25 16:46:01 +0200 | [diff] [blame] | 40 | def visit(self, node): |
| 41 | method = 'visit_' + node.__class__.__name__ |
| 42 | return getattr(self, method, self.generic_visit)(node) |
| 43 | |
| 44 | def generic_visit(self, node): |
eli.bendersky | dcb859c | 2011-03-05 17:02:43 +0200 | [diff] [blame] | 45 | #~ print('generic:', type(node)) |
eli.bendersky | afcfaac | 2011-02-25 16:46:01 +0200 | [diff] [blame] | 46 | if node is None: |
| 47 | return '' |
| 48 | else: |
| 49 | return ''.join(self.visit(c) for c in node.children()) |
eli.bendersky | d5ba345 | 2011-02-18 21:32:47 +0200 | [diff] [blame] | 50 | |
| 51 | def visit_Constant(self, n): |
eli.bendersky | afcfaac | 2011-02-25 16:46:01 +0200 | [diff] [blame] | 52 | return n.value |
| 53 | |
eli.bendersky | d5ba345 | 2011-02-18 21:32:47 +0200 | [diff] [blame] | 54 | def visit_ID(self, n): |
eli.bendersky | afcfaac | 2011-02-25 16:46:01 +0200 | [diff] [blame] | 55 | return n.name |
eli.bendersky | 3ae9f7a | 2011-02-27 07:19:41 +0200 | [diff] [blame] | 56 | |
| 57 | def visit_ArrayRef(self, n): |
eli.bendersky | b36f5bb | 2011-03-06 07:22:33 +0200 | [diff] [blame] | 58 | arrref = self._parenthesize_unless_simple(n.name) |
| 59 | return arrref + '[' + self.visit(n.subscript) + ']' |
eli.bendersky | 3ae9f7a | 2011-02-27 07:19:41 +0200 | [diff] [blame] | 60 | |
eli.bendersky | 724b1cc | 2011-03-05 10:45:08 +0200 | [diff] [blame] | 61 | def visit_StructRef(self, n): |
eli.bendersky | b36f5bb | 2011-03-06 07:22:33 +0200 | [diff] [blame] | 62 | sref = self._parenthesize_unless_simple(n.name) |
| 63 | return sref + n.type + self.visit(n.field) |
eli.bendersky | 724b1cc | 2011-03-05 10:45:08 +0200 | [diff] [blame] | 64 | |
| 65 | def visit_FuncCall(self, n): |
eli.bendersky | b36f5bb | 2011-03-06 07:22:33 +0200 | [diff] [blame] | 66 | fref = self._parenthesize_unless_simple(n.name) |
| 67 | return fref + '(' + self.visit(n.args) + ')' |
eli.bendersky | 724b1cc | 2011-03-05 10:45:08 +0200 | [diff] [blame] | 68 | |
eli.bendersky | ae36e96 | 2011-02-27 08:25:05 +0200 | [diff] [blame] | 69 | def visit_UnaryOp(self, n): |
eli.bendersky | b36f5bb | 2011-03-06 07:22:33 +0200 | [diff] [blame] | 70 | operand = self._parenthesize_unless_simple(n.expr) |
eli.bendersky | ae36e96 | 2011-02-27 08:25:05 +0200 | [diff] [blame] | 71 | if n.op == 'p++': |
eli.bendersky | b36f5bb | 2011-03-06 07:22:33 +0200 | [diff] [blame] | 72 | return '%s++' % operand |
eli.bendersky | d4a9975 | 2011-05-26 07:04:19 +0300 | [diff] [blame] | 73 | elif n.op == 'p--': |
| 74 | return '%s--' % operand |
eli.bendersky | 8348a9d | 2011-05-26 07:01:43 +0300 | [diff] [blame] | 75 | elif n.op == 'sizeof': |
| 76 | # Always parenthesize the argument of sizeof since it can be |
| 77 | # a name. |
| 78 | return 'sizeof(%s)' % self.visit(n.expr) |
eli.bendersky | ae36e96 | 2011-02-27 08:25:05 +0200 | [diff] [blame] | 79 | else: |
eli.bendersky | b36f5bb | 2011-03-06 07:22:33 +0200 | [diff] [blame] | 80 | return '%s%s' % (n.op, operand) |
eli.bendersky | ae36e96 | 2011-02-27 08:25:05 +0200 | [diff] [blame] | 81 | |
eli.bendersky | 3ae9f7a | 2011-02-27 07:19:41 +0200 | [diff] [blame] | 82 | def visit_BinaryOp(self, n): |
eli.bendersky | b36f5bb | 2011-03-06 07:22:33 +0200 | [diff] [blame] | 83 | lval_str = self._parenthesize_if(n.left, |
| 84 | lambda d: not self._is_simple_node(d)) |
| 85 | rval_str = self._parenthesize_if(n.right, |
| 86 | lambda d: not self._is_simple_node(d)) |
eli.bendersky | 724b1cc | 2011-03-05 10:45:08 +0200 | [diff] [blame] | 87 | return '%s %s %s' % (lval_str, n.op, rval_str) |
eli.bendersky | 3ae9f7a | 2011-02-27 07:19:41 +0200 | [diff] [blame] | 88 | |
| 89 | def visit_Assignment(self, n): |
eli.bendersky | 724b1cc | 2011-03-05 10:45:08 +0200 | [diff] [blame] | 90 | rval_str = self._parenthesize_if( |
| 91 | n.rvalue, |
| 92 | lambda n: isinstance(n, c_ast.Assignment)) |
| 93 | return '%s %s %s' % (self.visit(n.lvalue), n.op, rval_str) |
eli.bendersky | d5ba345 | 2011-02-18 21:32:47 +0200 | [diff] [blame] | 94 | |
| 95 | def visit_IdentifierType(self, n): |
eli.bendersky | 3ae9f7a | 2011-02-27 07:19:41 +0200 | [diff] [blame] | 96 | return ' '.join(n.names) |
eli.bendersky | d5ba345 | 2011-02-18 21:32:47 +0200 | [diff] [blame] | 97 | |
eli.bendersky | abb96e6 | 2011-03-05 16:30:05 +0200 | [diff] [blame] | 98 | def visit_Decl(self, n, no_type=False): |
| 99 | # no_type is used when a Decl is part of a DeclList, where the type is |
| 100 | # explicitly only for the first delaration in a list. |
| 101 | # |
| 102 | s = n.name if no_type else self._generate_decl(n) |
eli.bendersky | afcfaac | 2011-02-25 16:46:01 +0200 | [diff] [blame] | 103 | if n.bitsize: s += ' : ' + self.visit(n.bitsize) |
eli.bendersky | dcb859c | 2011-03-05 17:02:43 +0200 | [diff] [blame] | 104 | if n.init: |
| 105 | if isinstance(n.init, c_ast.ExprList): |
| 106 | s += ' = {' + self.visit(n.init) + '}' |
| 107 | else: |
| 108 | s += ' = ' + self.visit(n.init) |
eli.bendersky | afcfaac | 2011-02-25 16:46:01 +0200 | [diff] [blame] | 109 | return s |
eli.bendersky | d5ba345 | 2011-02-18 21:32:47 +0200 | [diff] [blame] | 110 | |
eli.bendersky | abb96e6 | 2011-03-05 16:30:05 +0200 | [diff] [blame] | 111 | def visit_DeclList(self, n): |
| 112 | s = self.visit(n.decls[0]) |
| 113 | if len(n.decls) > 1: |
| 114 | s += ', ' + ', '.join(self.visit_Decl(decl, no_type=True) |
| 115 | for decl in n.decls[1:]) |
| 116 | return s |
| 117 | |
eli.bendersky | 3ae9f7a | 2011-02-27 07:19:41 +0200 | [diff] [blame] | 118 | def visit_Typedef(self, n): |
| 119 | s = '' |
| 120 | if n.storage: s += ' '.join(n.storage) + ' ' |
| 121 | s += self._generate_type(n.type) |
| 122 | return s |
| 123 | |
| 124 | def visit_Cast(self, n): |
eli.bendersky | 6ed80a6 | 2011-05-09 18:22:33 +0300 | [diff] [blame] | 125 | s = '(' + self._generate_type(n.to_type) + ')' |
eli.bendersky | 3ae9f7a | 2011-02-27 07:19:41 +0200 | [diff] [blame] | 126 | return s + ' ' + self.visit(n.expr) |
| 127 | |
eli.bendersky | 724b1cc | 2011-03-05 10:45:08 +0200 | [diff] [blame] | 128 | def visit_ExprList(self, n): |
eli.bendersky | 8e6c586 | 2011-05-20 12:35:08 +0300 | [diff] [blame] | 129 | visited_subexprs = [] |
| 130 | for expr in n.exprs: |
| 131 | if isinstance(expr, c_ast.ExprList): |
| 132 | visited_subexprs.append('{' + self.visit(expr) + '}') |
| 133 | else: |
| 134 | visited_subexprs.append(self.visit(expr)) |
| 135 | return ', '.join(visited_subexprs) |
eli.bendersky | 724b1cc | 2011-03-05 10:45:08 +0200 | [diff] [blame] | 136 | |
eli.bendersky | 3ae9f7a | 2011-02-27 07:19:41 +0200 | [diff] [blame] | 137 | def visit_Enum(self, n): |
| 138 | s = 'enum' |
| 139 | if n.name: s += ' ' + n.name |
| 140 | if n.values: |
| 141 | s += ' {' |
| 142 | for i, enumerator in enumerate(n.values.enumerators): |
| 143 | s += enumerator.name |
| 144 | if enumerator.value: |
| 145 | s += ' = ' + self.visit(enumerator.value) |
| 146 | if i != len(n.values.enumerators) - 1: |
| 147 | s += ', ' |
| 148 | s += '}' |
| 149 | return s |
| 150 | |
| 151 | def visit_Struct(self, n): |
| 152 | s = 'struct' |
| 153 | if n.name: s += ' ' + n.name |
| 154 | if n.decls: |
| 155 | s += ' { \n' |
| 156 | for decl in n.decls: |
| 157 | s += ' ' + self.visit(decl) + ';\n' |
| 158 | s += '}' |
| 159 | return s |
| 160 | |
eli.bendersky | afcfaac | 2011-02-25 16:46:01 +0200 | [diff] [blame] | 161 | def visit_FuncDef(self, n): |
| 162 | decl = self.visit(n.decl) |
| 163 | self.indent_level = 0 |
eli.bendersky | 3ae9f7a | 2011-02-27 07:19:41 +0200 | [diff] [blame] | 164 | # The body is a Compound node |
eli.bendersky | afcfaac | 2011-02-25 16:46:01 +0200 | [diff] [blame] | 165 | body = self.visit(n.body) |
eli.bendersky | 3ae9f7a | 2011-02-27 07:19:41 +0200 | [diff] [blame] | 166 | return decl + '\n' + body + '\n' |
| 167 | |
| 168 | def visit_FileAST(self, n): |
| 169 | s = '' |
| 170 | for ext in n.ext: |
| 171 | if isinstance(ext, c_ast.FuncDef): |
| 172 | s += self.visit(ext) |
| 173 | else: |
| 174 | s += self.visit(ext) + ';\n' |
| 175 | return s |
| 176 | |
| 177 | def visit_Compound(self, n): |
| 178 | s = self._make_indent() + '{\n' |
| 179 | self.indent_level += 2 |
eli.bendersky | cad1cfd | 2011-05-26 06:56:27 +0300 | [diff] [blame] | 180 | if n.block_items: |
| 181 | s += ''.join(self._generate_stmt(stmt) for stmt in n.block_items) |
eli.bendersky | 3ae9f7a | 2011-02-27 07:19:41 +0200 | [diff] [blame] | 182 | self.indent_level -= 2 |
| 183 | s += self._make_indent() + '}\n' |
| 184 | return s |
| 185 | |
| 186 | def visit_ParamList(self, n): |
| 187 | return ', '.join(self.visit(param) for param in n.params) |
| 188 | |
| 189 | def visit_Return(self, n): |
| 190 | s = 'return' |
| 191 | if n.expr: s += ' ' + self.visit(n.expr) |
| 192 | return s + ';' |
| 193 | |
eli.bendersky | fc96e5e | 2011-03-04 09:51:23 +0200 | [diff] [blame] | 194 | def visit_Break(self, n): |
| 195 | return 'break;' |
| 196 | |
| 197 | def visit_Continue(self, n): |
| 198 | return 'continue;' |
eli.bendersky | 724b1cc | 2011-03-05 10:45:08 +0200 | [diff] [blame] | 199 | |
| 200 | def visit_TernaryOp(self, n): |
| 201 | s = self.visit(n.cond) + ' ? ' |
| 202 | s += self.visit(n.iftrue) + ' : ' |
| 203 | s += self.visit(n.iffalse) |
| 204 | return s |
| 205 | |
eli.bendersky | e6ecb1a | 2011-03-05 10:58:46 +0200 | [diff] [blame] | 206 | def visit_If(self, n): |
| 207 | s = 'if (' |
| 208 | if n.cond: s += self.visit(n.cond) |
| 209 | s += ')\n' |
| 210 | s += self._generate_stmt(n.iftrue, add_indent=True) |
| 211 | if n.iffalse: |
| 212 | s += self._make_indent() + 'else\n' |
| 213 | s += self._generate_stmt(n.iffalse, add_indent=True) |
| 214 | return s |
| 215 | |
eli.bendersky | ae36e96 | 2011-02-27 08:25:05 +0200 | [diff] [blame] | 216 | def visit_For(self, n): |
| 217 | s = 'for (' |
| 218 | if n.init: s += self.visit(n.init) |
| 219 | s += ';' |
| 220 | if n.cond: s += ' ' + self.visit(n.cond) |
| 221 | s += ';' |
| 222 | if n.next: s += ' ' + self.visit(n.next) |
| 223 | s += ')\n' |
| 224 | s += self._generate_stmt(n.stmt, add_indent=True) |
| 225 | return s |
| 226 | |
eli.bendersky | fc96e5e | 2011-03-04 09:51:23 +0200 | [diff] [blame] | 227 | def visit_While(self, n): |
| 228 | s = 'while (' |
| 229 | if n.cond: s += self.visit(n.cond) |
| 230 | s += ')\n' |
| 231 | s += self._generate_stmt(n.stmt, add_indent=True) |
| 232 | return s |
| 233 | |
eli.bendersky | e6ecb1a | 2011-03-05 10:58:46 +0200 | [diff] [blame] | 234 | def visit_DoWhile(self, n): |
| 235 | s = 'do\n' |
| 236 | s += self._generate_stmt(n.stmt, add_indent=True) |
| 237 | s += self._make_indent() + 'while (' |
| 238 | if n.cond: s += self.visit(n.cond) |
| 239 | s += ');' |
| 240 | return s |
| 241 | |
eli.bendersky | abb96e6 | 2011-03-05 16:30:05 +0200 | [diff] [blame] | 242 | def visit_Switch(self, n): |
| 243 | s = 'switch (' + self.visit(n.cond) + ')\n' |
| 244 | s += self._generate_stmt(n.stmt, add_indent=True) |
| 245 | return s |
| 246 | |
| 247 | def visit_Case(self, n): |
| 248 | s = 'case ' + self.visit(n.expr) + ':\n' |
| 249 | s += self._generate_stmt(n.stmt, add_indent=True) |
| 250 | return s |
| 251 | |
| 252 | def visit_Default(self, n): |
| 253 | return 'default:\n' + self._generate_stmt(n.stmt, add_indent=True) |
| 254 | |
| 255 | def visit_Label(self, n): |
| 256 | return n.name + ':\n' + self._generate_stmt(n.stmt) |
| 257 | |
| 258 | def visit_Goto(self, n): |
| 259 | return 'goto ' + n.name + ';' |
| 260 | |
eli.bendersky | e6ecb1a | 2011-03-05 10:58:46 +0200 | [diff] [blame] | 261 | def visit_EllipsisParam(self, n): |
| 262 | return '...' |
| 263 | |
eli.bendersky | abb96e6 | 2011-03-05 16:30:05 +0200 | [diff] [blame] | 264 | def visit_Struct(self, n): |
| 265 | return self._generate_struct_union(n, 'struct') |
| 266 | |
eli.bendersky | 8e6c586 | 2011-05-20 12:35:08 +0300 | [diff] [blame] | 267 | def visit_Typename(self, n): |
| 268 | return self._generate_type(n.type) |
| 269 | |
eli.bendersky | abb96e6 | 2011-03-05 16:30:05 +0200 | [diff] [blame] | 270 | def visit_Union(self, n): |
| 271 | return self._generate_struct_union(n, 'union') |
| 272 | |
eli.bendersky | dcb859c | 2011-03-05 17:02:43 +0200 | [diff] [blame] | 273 | def visit_NamedInitializer(self, n): |
| 274 | s = '' |
| 275 | for name in n.name: |
| 276 | if isinstance(name, c_ast.ID): |
| 277 | s += '.' + name.name |
| 278 | elif isinstance(name, c_ast.Constant): |
| 279 | s += '[' + name.value + ']' |
| 280 | s += ' = ' + self.visit(n.expr) |
| 281 | return s |
| 282 | |
eli.bendersky | abb96e6 | 2011-03-05 16:30:05 +0200 | [diff] [blame] | 283 | def _generate_struct_union(self, n, name): |
| 284 | """ Generates code for structs and unions. name should be either |
| 285 | 'struct' or union. |
| 286 | """ |
eli.bendersky | dcb859c | 2011-03-05 17:02:43 +0200 | [diff] [blame] | 287 | s = name + ' ' + (n.name or '') |
| 288 | if n.decls: |
| 289 | s += '\n' |
| 290 | s += self._make_indent() |
| 291 | self.indent_level += 2 |
| 292 | s += '{\n' |
| 293 | for decl in n.decls: |
| 294 | s += self._generate_stmt(decl) |
| 295 | self.indent_level -= 2 |
| 296 | s += self._make_indent() + '}' |
eli.bendersky | abb96e6 | 2011-03-05 16:30:05 +0200 | [diff] [blame] | 297 | return s |
| 298 | |
eli.bendersky | ae36e96 | 2011-02-27 08:25:05 +0200 | [diff] [blame] | 299 | def _generate_stmt(self, n, add_indent=False): |
eli.bendersky | 3ae9f7a | 2011-02-27 07:19:41 +0200 | [diff] [blame] | 300 | """ Generation from a statement node. This method exists as a wrapper |
| 301 | for individual visit_* methods to handle different treatment of |
| 302 | some statements in this context. |
| 303 | """ |
| 304 | typ = type(n) |
eli.bendersky | ae36e96 | 2011-02-27 08:25:05 +0200 | [diff] [blame] | 305 | if add_indent: self.indent_level += 2 |
eli.bendersky | fc96e5e | 2011-03-04 09:51:23 +0200 | [diff] [blame] | 306 | indent = self._make_indent() |
eli.bendersky | ae36e96 | 2011-02-27 08:25:05 +0200 | [diff] [blame] | 307 | if add_indent: self.indent_level -= 2 |
eli.bendersky | 3ae9f7a | 2011-02-27 07:19:41 +0200 | [diff] [blame] | 308 | |
eli.bendersky | 724b1cc | 2011-03-05 10:45:08 +0200 | [diff] [blame] | 309 | if typ in ( |
| 310 | c_ast.Decl, c_ast.Assignment, c_ast.Cast, c_ast.UnaryOp, |
eli.bendersky | b36f5bb | 2011-03-06 07:22:33 +0200 | [diff] [blame] | 311 | c_ast.BinaryOp, c_ast.TernaryOp, c_ast.FuncCall, c_ast.ArrayRef, |
| 312 | c_ast.StructRef): |
eli.bendersky | 3ae9f7a | 2011-02-27 07:19:41 +0200 | [diff] [blame] | 313 | # These can also appear in an expression context so no semicolon |
| 314 | # is added to them automatically |
| 315 | # |
eli.bendersky | fc96e5e | 2011-03-04 09:51:23 +0200 | [diff] [blame] | 316 | return indent + self.visit(n) + ';\n' |
eli.bendersky | 3ae9f7a | 2011-02-27 07:19:41 +0200 | [diff] [blame] | 317 | elif typ in (c_ast.Compound,): |
| 318 | # No extra indentation required before the opening brace of a |
| 319 | # compound - because it consists of multiple lines it has to |
| 320 | # compute its own indentation. |
| 321 | # |
eli.bendersky | ae36e96 | 2011-02-27 08:25:05 +0200 | [diff] [blame] | 322 | return self.visit(n) |
eli.bendersky | 3ae9f7a | 2011-02-27 07:19:41 +0200 | [diff] [blame] | 323 | else: |
eli.bendersky | fc96e5e | 2011-03-04 09:51:23 +0200 | [diff] [blame] | 324 | return indent + self.visit(n) + '\n' |
eli.bendersky | afcfaac | 2011-02-25 16:46:01 +0200 | [diff] [blame] | 325 | |
eli.bendersky | d5ba345 | 2011-02-18 21:32:47 +0200 | [diff] [blame] | 326 | def _generate_decl(self, n): |
| 327 | """ Generation from a Decl node. |
| 328 | """ |
eli.bendersky | afcfaac | 2011-02-25 16:46:01 +0200 | [diff] [blame] | 329 | s = '' |
| 330 | if n.funcspec: s = ' '.join(n.funcspec) + ' ' |
| 331 | if n.storage: s += ' '.join(n.storage) + ' ' |
| 332 | s += self._generate_type(n.type) |
| 333 | return s |
eli.bendersky | d5ba345 | 2011-02-18 21:32:47 +0200 | [diff] [blame] | 334 | |
| 335 | def _generate_type(self, n, modifiers=[]): |
| 336 | """ Recursive generation from a type node. n is the type node. |
eli.bendersky | afcfaac | 2011-02-25 16:46:01 +0200 | [diff] [blame] | 337 | modifiers collects the PtrDecl, ArrayDecl and FuncDecl modifiers |
| 338 | encountered on the way down to a TypeDecl, to allow proper |
| 339 | generation from it. |
eli.bendersky | d5ba345 | 2011-02-18 21:32:47 +0200 | [diff] [blame] | 340 | """ |
| 341 | typ = type(n) |
| 342 | #~ print(n, modifiers) |
| 343 | |
| 344 | if typ == c_ast.TypeDecl: |
eli.bendersky | afcfaac | 2011-02-25 16:46:01 +0200 | [diff] [blame] | 345 | s = '' |
| 346 | if n.quals: s += ' '.join(n.quals) + ' ' |
| 347 | s += self.visit(n.type) |
eli.bendersky | d5ba345 | 2011-02-18 21:32:47 +0200 | [diff] [blame] | 348 | |
| 349 | nstr = n.declname if n.declname else '' |
eli.bendersky | 3ae9f7a | 2011-02-27 07:19:41 +0200 | [diff] [blame] | 350 | # Resolve modifiers. |
eli.bendersky | afcfaac | 2011-02-25 16:46:01 +0200 | [diff] [blame] | 351 | # Wrap in parens to distinguish pointer to array and pointer to |
| 352 | # function syntax. |
eli.bendersky | d5ba345 | 2011-02-18 21:32:47 +0200 | [diff] [blame] | 353 | # |
| 354 | for i, modifier in enumerate(modifiers): |
| 355 | if isinstance(modifier, c_ast.ArrayDecl): |
| 356 | if (i != 0 and isinstance(modifiers[i - 1], c_ast.PtrDecl)): |
| 357 | nstr = '(' + nstr + ')' |
eli.bendersky | afcfaac | 2011-02-25 16:46:01 +0200 | [diff] [blame] | 358 | nstr += '[' + self.visit(modifier.dim) + ']' |
| 359 | elif isinstance(modifier, c_ast.FuncDecl): |
| 360 | if (i != 0 and isinstance(modifiers[i - 1], c_ast.PtrDecl)): |
| 361 | nstr = '(' + nstr + ')' |
| 362 | nstr += '(' + self.visit(modifier.args) + ')' |
eli.bendersky | d5ba345 | 2011-02-18 21:32:47 +0200 | [diff] [blame] | 363 | elif isinstance(modifier, c_ast.PtrDecl): |
| 364 | nstr = '*' + nstr |
eli.bendersky | 3ae9f7a | 2011-02-27 07:19:41 +0200 | [diff] [blame] | 365 | s += ' ' + nstr |
eli.bendersky | afcfaac | 2011-02-25 16:46:01 +0200 | [diff] [blame] | 366 | return s |
eli.bendersky | 6ed80a6 | 2011-05-09 18:22:33 +0300 | [diff] [blame] | 367 | elif typ == c_ast.Decl: |
eli.bendersky | afcfaac | 2011-02-25 16:46:01 +0200 | [diff] [blame] | 368 | return self._generate_decl(n.type) |
eli.bendersky | 6ed80a6 | 2011-05-09 18:22:33 +0300 | [diff] [blame] | 369 | elif typ == c_ast.Typename: |
| 370 | return self._generate_type(n.type) |
eli.bendersky | d5ba345 | 2011-02-18 21:32:47 +0200 | [diff] [blame] | 371 | elif typ == c_ast.IdentifierType: |
eli.bendersky | afcfaac | 2011-02-25 16:46:01 +0200 | [diff] [blame] | 372 | return ' '.join(n.names) + ' ' |
| 373 | elif typ in (c_ast.ArrayDecl, c_ast.PtrDecl, c_ast.FuncDecl): |
| 374 | return self._generate_type(n.type, modifiers + [n]) |
eli.bendersky | abb96e6 | 2011-03-05 16:30:05 +0200 | [diff] [blame] | 375 | else: |
| 376 | return self.visit(n) |
eli.bendersky | d5ba345 | 2011-02-18 21:32:47 +0200 | [diff] [blame] | 377 | |
eli.bendersky | 724b1cc | 2011-03-05 10:45:08 +0200 | [diff] [blame] | 378 | def _parenthesize_if(self, n, condition): |
| 379 | """ Visits 'n' and returns its string representation, parenthesized |
| 380 | if the condition function applied to the node returns True. |
| 381 | """ |
| 382 | s = self.visit(n) |
| 383 | if condition(n): |
| 384 | return '(' + s + ')' |
| 385 | else: |
| 386 | return s |
| 387 | |
eli.bendersky | b36f5bb | 2011-03-06 07:22:33 +0200 | [diff] [blame] | 388 | def _parenthesize_unless_simple(self, n): |
| 389 | """ Common use case for _parenthesize_if |
| 390 | """ |
| 391 | return self._parenthesize_if(n, lambda d: not self._is_simple_node(d)) |
| 392 | |
| 393 | def _is_simple_node(self, n): |
| 394 | """ Returns True for nodes that are "simple" - i.e. nodes that always |
| 395 | have higher precedence than operators. |
| 396 | """ |
| 397 | return isinstance(n,( c_ast.Constant, c_ast.ID, c_ast.ArrayRef, |
| 398 | c_ast.StructRef, c_ast.FuncCall)) |
| 399 | |
eli.bendersky | d5ba345 | 2011-02-18 21:32:47 +0200 | [diff] [blame] | 400 | |
| 401 | def translate_to_c(filename): |
| 402 | ast = parse_file(filename, use_cpp=True) |
| 403 | generator = CGenerator() |
eli.bendersky | afcfaac | 2011-02-25 16:46:01 +0200 | [diff] [blame] | 404 | print(generator.visit(ast)) |
eli.bendersky | d5ba345 | 2011-02-18 21:32:47 +0200 | [diff] [blame] | 405 | |
| 406 | |
eli.bendersky | b36f5bb | 2011-03-06 07:22:33 +0200 | [diff] [blame] | 407 | def zz_test_translate(): |
| 408 | # internal use |
eli.bendersky | 8e6c586 | 2011-05-20 12:35:08 +0300 | [diff] [blame] | 409 | src = r''' |
eli.bendersky | 8348a9d | 2011-05-26 07:01:43 +0300 | [diff] [blame] | 410 | int main(void) |
| 411 | { |
eli.bendersky | d4a9975 | 2011-05-26 07:04:19 +0300 | [diff] [blame] | 412 | int a; |
| 413 | int b = a++; |
| 414 | int c = ++a; |
| 415 | int d = a--; |
| 416 | int e = --a; |
eli.bendersky | 8348a9d | 2011-05-26 07:01:43 +0300 | [diff] [blame] | 417 | } |
| 418 | ''' |
eli.bendersky | 8e6c586 | 2011-05-20 12:35:08 +0300 | [diff] [blame] | 419 | parser = c_parser.CParser() |
| 420 | ast = parser.parse(src) |
| 421 | ast.show() |
| 422 | generator = CGenerator() |
| 423 | |
| 424 | print(generator.visit(ast)) |
| 425 | |
| 426 | # tracing the generator for debugging |
| 427 | #~ import trace |
| 428 | #~ tr = trace.Trace(countcallers=1) |
| 429 | #~ tr.runfunc(generator.visit, ast) |
| 430 | #~ tr.results().write_results() |
eli.bendersky | b36f5bb | 2011-03-06 07:22:33 +0200 | [diff] [blame] | 431 | |
| 432 | |
| 433 | #------------------------------------------------------------------------------ |
| 434 | if __name__ == "__main__": |
eli.bendersky | 6ed80a6 | 2011-05-09 18:22:33 +0300 | [diff] [blame] | 435 | zz_test_translate() |
eli.bendersky | b36f5bb | 2011-03-06 07:22:33 +0200 | [diff] [blame] | 436 | if len(sys.argv) > 1: |
| 437 | translate_to_c(sys.argv[1]) |
| 438 | else: |
eli.bendersky | d5ba345 | 2011-02-18 21:32:47 +0200 | [diff] [blame] | 439 | print("Please provide a filename as argument") |
eli.bendersky | 3ae9f7a | 2011-02-27 07:19:41 +0200 | [diff] [blame] | 440 | |