Skip to main content
Code Golf

Return to Answer

deleted 3 characters in body
Source Link
Mitch Schwartz
Mitch Schwartz
  • 5.9k
  • 1
  • 27
  • 26

sed, 166165 bytes

s > >[-]+> g
s < << g
1s \. >[-]-R+[[>+<-]<[>+<-]<]>+[->>+]<[>+>>-<L+>R+<<<-]>[<+>-]+< g
1s .* R&<R+> 
2s , ,[-]>[-]<L[[>]R<+L[<]>,]>,<L[[>]R<+L[<]>-]>[>]R+< g
s L <[<<]< g
s R >>[>>] g

For flavors with EOF = 0, cells left of start disallowed, 8-bit wrapping cells.

Expects program A on the first line and B on the second line.

Try it onlineTry it online

This uses 2-cell nodes to simulate the tapes of A and B, with A's output occupying contiguous cells to the left of the leftmost node.

Alternative 174173-byte solution:

1i>>
s > >[-]+> g
s < << g
1s \. >[-]-[>>]+[[>+<-]<[>+<-]<]>+[->>+]<[>>>-<<+[<<]<+>>>[>>]+<<<-]>[<+>-]+< g
1a>[>>]+>
2s , ,[-]>[-]<<[<<]<[[>]>>[>>]<+<[<<]<[<]>,]>,<<[<<]<[[>]>>[>>]<+<[<<]<[<]>-]>[>]>>[>>]+< g

Try it onlineTry it online

Originally my design was based on a doubly infinite tape, which required significantly more work to move left (moving data when passing beyond the leftmost cell previously encountered) and to transition from A to B (clearing the data instead of just traveling past the rightmost cell previously encountered).

Thanks to Sylwester and Dorian for tricks and ideas.

sed, 166 bytes

s > >[-]+> g
s < << g
1s \. >[-]-R+[[>+<-]<[>+<-]<]>+[->>+]<[>+>>-<L+>R+<<<-]>[<+>-]+< g
1s .* R&<R+> 
2s , [-]>[-]<L[[>]R<+L[<]>-]>[>]R+< g
s L <[<<]< g
s R >>[>>] g

For flavors with EOF = 0, cells left of start disallowed, 8-bit wrapping cells.

Expects program A on the first line and B on the second line.

Try it online

This uses 2-cell nodes to simulate the tapes of A and B, with A's output occupying contiguous cells to the left of the leftmost node.

Alternative 174-byte solution:

1i>>
s > >[-]+> g
s < << g
1s \. >[-]-[>>]+[[>+<-]<[>+<-]<]>+[->>+]<[>>>-<<+[<<]<+>>>[>>]+<<<-]>[<+>-]+< g
1a>[>>]+>
2s , [-]>[-]<<[<<]<[[>]>>[>>]<+<[<<]<[<]>-]>[>]>>[>>]+< g

Try it online

Originally my design was based on a doubly infinite tape, which required significantly more work to move left (moving data when passing beyond the leftmost cell previously encountered) and to transition from A to B (clearing the data instead of just traveling past the rightmost cell previously encountered).

Thanks to Sylwester and Dorian for tricks and ideas.

sed, 165 bytes

s > >[-]+> g
s < << g
1s \. >[-]-R+[[>+<-]<[>+<-]<]>+[->>+]<[>+>>-<L+>R+<<<-]>[<+>-]+< g
1s .* R&<R+> 
2s , ,[,]>,<L[[>]R<+L[<]>-]>[>]R+< g
s L <[<<]< g
s R >>[>>] g

For flavors with EOF = 0, cells left of start disallowed, 8-bit wrapping cells.

Expects program A on the first line and B on the second line.

Try it online

This uses 2-cell nodes to simulate the tapes of A and B, with A's output occupying contiguous cells to the left of the leftmost node.

Alternative 173-byte solution:

1i>>
s > >[-]+> g
s < << g
1s \. >[-]-[>>]+[[>+<-]<[>+<-]<]>+[->>+]<[>>>-<<+[<<]<+>>>[>>]+<<<-]>[<+>-]+< g
1a>[>>]+>
2s , ,[,]>,<<[<<]<[[>]>>[>>]<+<[<<]<[<]>-]>[>]>>[>>]+< g

Try it online

Originally my design was based on a doubly infinite tape, which required significantly more work to move left (moving data when passing beyond the leftmost cell previously encountered) and to transition from A to B (clearing the data instead of just traveling past the rightmost cell previously encountered).

Thanks to Sylwester and Dorian for tricks and ideas.

deleted 14 characters in body
Source Link
Mitch Schwartz
Mitch Schwartz
  • 5.9k
  • 1
  • 27
  • 26

sed, 168166 bytes

s > >[-]+> g
s < << g
1s \. >[-]-R+[[>+<-]<[>+<-]<]>+[->>+]<[>>>>>+]<[>+>>-<<+[<<]<+>R+<<<<L+>R+<<<-]>[<+>-]+< g
1s .* R&<R+> 
2s , [-]>[-]<<[<<]<[[>]R<+<[<<]<[<]>]<L[[>]R<+L[<]>-]>[>]R+< g
s L <[<<]< g
s R >>[>>] g

For flavors with EOF = 0, cells left of start disallowed, 8-bit wrapping cells.

Expects program A on the first line and B on the second line.

Try it onlineTry it online

This uses 2-cell nodes to simulate the tapes of A and B, with A's output occupying contiguous cells to the left of the leftmost node.

Alternative 174-byte solution:

1i>>
s > >[-]+> g
s < << g
1s \. >[-]-[>>]+[[>+<-]<[>+<-]<]>+[->>+]<[>>>-<<+[<<]<+>>>[>>]+<<<-]>[<+>-]+< g
1a>[>>]+>
2s , [-]>[-]<<[<<]<[[>]>>[>>]<+<[<<]<[<]>-]>[>]>>[>>]+< g

Try it online

Originally my design was based on a doubly infinite tape, which required significantly more work to move left (moving data when passing beyond the leftmost cell previously encountered) and to transition from A to B (clearing the data instead of just traveling past the rightmost cell previously encountered).

Thanks to Sylwester and Dorian for tricks and ideas.

sed, 168 bytes

s > >[-]+> g
s < << g
1s \. >[-]-R+[[>+<-]<[>+<-]<]>+[->>+]<[>>>-<<+[<<]<+>R+<<<-]>[<+>-]+< g
1s .* R&<R+> 
2s , [-]>[-]<<[<<]<[[>]R<+<[<<]<[<]>-]>[>]R+< g
s R >>[>>] g

For flavors with EOF = 0, cells left of start disallowed, 8-bit wrapping cells.

Expects program A on the first line and B on the second line.

Try it online

This uses 2-cell nodes to simulate the tapes of A and B, with A's output occupying contiguous cells to the left of the leftmost node.

Alternative 174-byte solution:

1i>>
s > >[-]+> g
s < << g
1s \. >[-]-[>>]+[[>+<-]<[>+<-]<]>+[->>+]<[>>>-<<+[<<]<+>>>[>>]+<<<-]>[<+>-]+< g
1a>[>>]+>
2s , [-]>[-]<<[<<]<[[>]>>[>>]<+<[<<]<[<]>-]>[>]>>[>>]+< g

Try it online

Originally my design was based on a doubly infinite tape, which required significantly more work to move left (moving data when passing beyond the leftmost cell previously encountered) and to transition from A to B (clearing the data instead of just traveling past the rightmost cell previously encountered).

Thanks to Sylwester and Dorian for tricks and ideas.

sed, 166 bytes

s > >[-]+> g
s < << g
1s \. >[-]-R+[[>+<-]<[>+<-]<]>+[->>+]<[>+>>-<L+>R+<<<-]>[<+>-]+< g
1s .* R&<R+> 
2s , [-]>[-]<L[[>]R<+L[<]>-]>[>]R+< g
s L <[<<]< g
s R >>[>>] g

For flavors with EOF = 0, cells left of start disallowed, 8-bit wrapping cells.

Expects program A on the first line and B on the second line.

Try it online

This uses 2-cell nodes to simulate the tapes of A and B, with A's output occupying contiguous cells to the left of the leftmost node.

Alternative 174-byte solution:

1i>>
s > >[-]+> g
s < << g
1s \. >[-]-[>>]+[[>+<-]<[>+<-]<]>+[->>+]<[>>>-<<+[<<]<+>>>[>>]+<<<-]>[<+>-]+< g
1a>[>>]+>
2s , [-]>[-]<<[<<]<[[>]>>[>>]<+<[<<]<[<]>-]>[>]>>[>>]+< g

Try it online

Originally my design was based on a doubly infinite tape, which required significantly more work to move left (moving data when passing beyond the leftmost cell previously encountered) and to transition from A to B (clearing the data instead of just traveling past the rightmost cell previously encountered).

Thanks to Sylwester and Dorian for tricks and ideas.

deleted 14 characters in body
Source Link
Mitch Schwartz
Mitch Schwartz
  • 5.9k
  • 1
  • 27
  • 26

sed, 171168 bytes

s > >[-]+> g
s < << g
1s \. >[-]-R+[[>+<-]<[>+<-]<]>+[->>+]>>>>+]<[>>>-<<<[>+[<<]<+>R<<<<<+[<<]<+>R+<<<-]>[<+>-]+R+<<<]+< g
1s .* R&<R+> 
2s , [-]>[-]<<[<<]<[[>]R<+<[<<]<[<]>-]>[>]R+< g
s R >>[>>] g

For flavors with EOF = 0, cells left of start disallowed, 8-bit wrapping cells.

Expects program A on the first line and B on the second line.

Try it onlineTry it online

This uses 2-cell nodes to simulate the tapes of A and B, with A's output occupying contiguous cells to the left of the leftmost node.

Alternative 178174-byte solution:

1i>>
s > >[-]+> g
s < << g
1s \. >[-]-[>>]+[[>+<-]<[>+<-]<]>+[->>+]>>>>+]<[>>>-<<<[>+[<<]<+>>>[>>]<<<<<+[<<]<+>>>[>>]+<<<-]>[<+>-]+>>+<<<]+< g
1a>[>>]+>
2s , [-]>[-]<<[<<]<[[>]>>[>>]<+<[<<]<[<]>-]>[>]>>[>>]+< g

Try it onlineTry it online

Originally my design was based on a doubly infinite tape, which required significantly more work to move left (moving data when passing beyond the leftmost cell previously encountered) and to transition from A to B (clearing the data instead of just traveling past the rightmost cell previously encountered).

Thanks to Sylwester and Dorian for tricks and ideas.

sed, 171 bytes

s > >[-]+> g
s < << g
1s \. >[-]-R+[[>+<-]<[>+<-]<]>+[->>+]>>-<<<[>+[<<]<+>R<<<-]>[<+>-]+R+<<< g
1s .* R&<R+> 
2s , [-]>[-]<<[<<]<[[>]R<+<[<<]<[<]>-]>[>]R+< g
s R >>[>>] g

For flavors with EOF = 0, cells left of start disallowed, 8-bit wrapping cells.

Expects program A on the first line and B on the second line.

Try it online

This uses 2-cell nodes to simulate the tapes of A and B, with A's output occupying contiguous cells to the left of the leftmost node.

Alternative 178-byte solution:

1i>>
s > >[-]+> g
s < << g
1s \. >[-]-[>>]+[[>+<-]<[>+<-]<]>+[->>+]>>-<<<[>+[<<]<+>>>[>>]<<<-]>[<+>-]+>>+<<< g
1a>[>>]+>
2s , [-]>[-]<<[<<]<[[>]>>[>>]<+<[<<]<[<]>-]>[>]>>[>>]+< g

Try it online

Originally my design was based on a doubly infinite tape, which required significantly more work to move left (moving data when passing beyond the leftmost cell previously encountered) and to transition from A to B (clearing the data instead of just traveling past the rightmost cell previously encountered).

Thanks to Sylwester and Dorian for tricks and ideas.

sed, 168 bytes

s > >[-]+> g
s < << g
1s \. >[-]-R+[[>+<-]<[>+<-]<]>+[->>+]<[>>>-<<+[<<]<+>R+<<<-]>[<+>-]+< g
1s .* R&<R+> 
2s , [-]>[-]<<[<<]<[[>]R<+<[<<]<[<]>-]>[>]R+< g
s R >>[>>] g

For flavors with EOF = 0, cells left of start disallowed, 8-bit wrapping cells.

Expects program A on the first line and B on the second line.

Try it online

This uses 2-cell nodes to simulate the tapes of A and B, with A's output occupying contiguous cells to the left of the leftmost node.

Alternative 174-byte solution:

1i>>
s > >[-]+> g
s < << g
1s \. >[-]-[>>]+[[>+<-]<[>+<-]<]>+[->>+]<[>>>-<<+[<<]<+>>>[>>]+<<<-]>[<+>-]+< g
1a>[>>]+>
2s , [-]>[-]<<[<<]<[[>]>>[>>]<+<[<<]<[<]>-]>[>]>>[>>]+< g

Try it online

Originally my design was based on a doubly infinite tape, which required significantly more work to move left (moving data when passing beyond the leftmost cell previously encountered) and to transition from A to B (clearing the data instead of just traveling past the rightmost cell previously encountered).

Thanks to Sylwester and Dorian for tricks and ideas.

deleted 11 characters in body
Source Link
Mitch Schwartz
Mitch Schwartz
  • 5.9k
  • 1
  • 27
  • 26
added 451 characters in body
Source Link
Mitch Schwartz
Mitch Schwartz
  • 5.9k
  • 1
  • 27
  • 26
deleted 1033 characters in body
Source Link
Mitch Schwartz
Mitch Schwartz
  • 5.9k
  • 1
  • 27
  • 26
bug fix
Source Link
Mitch Schwartz
Mitch Schwartz
  • 5.9k
  • 1
  • 27
  • 26
deleted 6 characters in body
Source Link
Mitch Schwartz
Mitch Schwartz
  • 5.9k
  • 1
  • 27
  • 26
deleted 4 characters in body
Source Link
Mitch Schwartz
Mitch Schwartz
  • 5.9k
  • 1
  • 27
  • 26
added 471 characters in body
Source Link
Mitch Schwartz
Mitch Schwartz
  • 5.9k
  • 1
  • 27
  • 26
added 1 character in body
Source Link
Mitch Schwartz
Mitch Schwartz
  • 5.9k
  • 1
  • 27
  • 26
fix bug; 199 -> 204 actually a rollback, except the 204 was overwritten during grace period
Source Link
Mitch Schwartz
Mitch Schwartz
  • 5.9k
  • 1
  • 27
  • 26
deleted 5 characters in body
Source Link
Mitch Schwartz
Mitch Schwartz
  • 5.9k
  • 1
  • 27
  • 26
added 645 characters in body
Source Link
Mitch Schwartz
Mitch Schwartz
  • 5.9k
  • 1
  • 27
  • 26
deleted 2 characters in body
Source Link
Mitch Schwartz
Mitch Schwartz
  • 5.9k
  • 1
  • 27
  • 26
deleted 9 characters in body
Source Link
Mitch Schwartz
Mitch Schwartz
  • 5.9k
  • 1
  • 27
  • 26
Post Undeleted by Mitch Schwartz
fix silly mistake
Source Link
Mitch Schwartz
Mitch Schwartz
  • 5.9k
  • 1
  • 27
  • 26
Post Deleted by Mitch Schwartz
added 198 characters in body
Source Link
Mitch Schwartz
Mitch Schwartz
  • 5.9k
  • 1
  • 27
  • 26
Source Link
Mitch Schwartz
Mitch Schwartz
  • 5.9k
  • 1
  • 27
  • 26