More or less just writing each line backward (token by token). Q1: How close could one get to a grammar that would basically recognize C with each line reverse

More or less just writing each line backward (token by token). Q1: How close could one get to a grammar that would basically recognize C with each line reversed character-by-character? Q2: What would a language look like where instead of being oriented into right- or leftward-marching lines, it was oriented into downward-marching columns?