Files
carbon-lang/executable_semantics/testdata/tuple2.golden
T
Jon Meow 6e5070de18 Adapting jsiek's executable semantics tooling for commit. (#237)
Notes versus what jsiek wrote:

- This adopts Bazel for building.
    - System-local versions of bison/flex are used. I found https://github.com/jmillikin/rules_bison, but those print a lot of warnings (things like -Wsign-compare IIRC) which makes builds hard to read. Plus I think the underlying bison_cc_library rule didn't work, so this would really only get a hermetic bison/flex build (helpful, but didn't seem worth more time).
    - I'm adding in a .bazeliskrc to push a somewhat more standard choice of bazel versions. I noticed I was getting unstable versions by default, possible Google-specific, but seemed good to include.
    - The `-lpthread` kludge.
- Turn all of the examples into golden tests.
    - Including adding a golden test rule.
- Fixed various style guide issues. For example:
    - Fixing function names to be CamelCase instead of snake_case (https://google.github.io/styleguide/cppguide.html#Function_Names)
    - Removed exception use (https://google.github.io/styleguide/cppguide.html#Exceptions)
    - File name fixes (https://github.com/carbon-language/carbon-lang/blob/trunk/docs/project/cpp_style_guide.md#file-names)
- Dropped `using` of `std` names -- I believe this is preferred (maybe we should be explicit about this in the Carbon style guide)
- Switched `enum` uses to `enum class` for ease-of-identification.
- Spent some time breaking out files to hopefully be easier to read/edit pieces, and understand relations between structs.
- Added `code requires` to `syntax.ypp` to address include issues

Possibly other things -- but the fundamental structure is, I believe, unchanged. I put in the golden tests pretty early to ensure I wasn't mutating output/results.
2021-02-19 15:25:43 -08:00

200 lines
5.7 KiB
Plaintext

********** source program **********
fn main () -> Int {
var (0 = Int): t = (0 = 5);
return (t[0] - 5);
}
********** type checking **********
--- step exp Int --->
--- step exp Int --->
--- step exp (0 = Int) --->
--- step exp Int --->
--- handle value Int with (0 = Int)<1>(Int,) --->
--- step exp 0 --->
********** type checking complete **********
fn main () -> Int {
var (0 = Int): t = (0 = 5);
return (t[0] - 5);
}
********** starting execution **********
********** initializing globals **********
--- step exp () --->
********** calling main function **********
{
stack: top{main()<-1>}
heap: fun<main>,
env: main: fun<main>,
}
--- step exp main() --->
{
stack: top{main<-1> :: main()<0>}
heap: fun<main>,
env: main: fun<main>,
}
--- step exp main --->
{
stack: top{fun<main><-1> :: main()<0>}
heap: fun<main>,
env: main: fun<main>,
}
--- handle value fun<main> with main()<1>(fun<main>,) --->
{
stack: top{()<-1> :: main()<1>(fun<main>,)}
heap: fun<main>,
env: main: fun<main>,
}
--- step exp () --->
{
stack: top{()<-1> :: main()<1>(fun<main>,)}
heap: fun<main>,
env: main: fun<main>,
}
--- handle value () with main()<2>(fun<main>,(),) --->
pattern_match((), ())
{
stack: main{var (0 = Int): t = (0 = 5); ... <-1>} :: top{}
heap: fun<main>,
env: main: fun<main>,
}
--- step stmt var (0 = Int): t = (0 = 5); ... --->
{
stack: main{var (0 = Int): t = (0 = 5);<-1> :: return (t[0] - 5);<-1>} :: top{}
heap: fun<main>,
env: main: fun<main>,
}
--- step stmt var (0 = Int): t = (0 = 5); --->
{
stack: main{(0 = 5)<-1> :: var (0 = Int): t = (0 = 5);<0> :: return (t[0] - 5);<-1>} :: top{}
heap: fun<main>,
env: main: fun<main>,
}
--- step exp (0 = 5) --->
{
stack: main{5<-1> :: (0 = 5)<0> :: var (0 = Int): t = (0 = 5);<0> :: return (t[0] - 5);<-1>} :: top{}
heap: fun<main>,
env: main: fun<main>,
}
--- step exp 5 --->
{
stack: main{5<-1> :: (0 = 5)<0> :: var (0 = Int): t = (0 = 5);<0> :: return (t[0] - 5);<-1>} :: top{}
heap: fun<main>,
env: main: fun<main>,
}
--- handle value 5 with (0 = 5)<1>(5,) --->
{
stack: main{(0 = 5@1)<-1> :: var (0 = Int): t = (0 = 5);<0> :: return (t[0] - 5);<-1>} :: top{}
heap: fun<main>, 5,
env: main: fun<main>,
}
--- handle value (0 = 5@1) with var (0 = Int): t = (0 = 5);<1>((0 = 5@1),) --->
{
stack: main{(0 = Int): t<-1> :: var (0 = Int): t = (0 = 5);<1>((0 = 5@1),) :: return (t[0] - 5);<-1>} :: top{}
heap: fun<main>, 5,
env: main: fun<main>,
}
--- step exp (0 = Int): t --->
{
stack: main{(0 = Int)<-1> :: (0 = Int): t<0> :: var (0 = Int): t = (0 = 5);<1>((0 = 5@1),) :: return (t[0] - 5);<-1>} :: top{}
heap: fun<main>, 5,
env: main: fun<main>,
}
--- step exp (0 = Int) --->
{
stack: main{Int<-1> :: (0 = Int)<0> :: (0 = Int): t<0> :: var (0 = Int): t = (0 = 5);<1>((0 = 5@1),) :: return (t[0] - 5);<-1>} :: top{}
heap: fun<main>, 5,
env: main: fun<main>,
}
--- step exp Int --->
{
stack: main{Int<-1> :: (0 = Int)<0> :: (0 = Int): t<0> :: var (0 = Int): t = (0 = 5);<1>((0 = 5@1),) :: return (t[0] - 5);<-1>} :: top{}
heap: fun<main>, 5,
env: main: fun<main>,
}
--- handle value Int with (0 = Int)<1>(Int,) --->
{
stack: main{(0 = Int@2)<-1> :: (0 = Int): t<0> :: var (0 = Int): t = (0 = 5);<1>((0 = 5@1),) :: return (t[0] - 5);<-1>} :: top{}
heap: fun<main>, 5, Int,
env: main: fun<main>,
}
--- handle value (0 = Int@2) with (0 = Int): t<1>((0 = Int@2),) --->
{
stack: main{(0 = Int@2): t<-1> :: var (0 = Int): t = (0 = 5);<1>((0 = 5@1),) :: return (t[0] - 5);<-1>} :: top{}
heap: fun<main>, 5, Int,
env: main: fun<main>,
}
--- handle value (0 = Int@2): t with var (0 = Int): t = (0 = 5);<2>((0 = 5@1),(0 = Int@2): t,) --->
pattern_match((0 = Int@2): t, (0 = 5@1))
{
stack: main{return (t[0] - 5);<-1>} :: top{}
heap: fun<main>, 5, Int, 5, (0 = 5@3),
env: t: (0 = 5@3), main: fun<main>,
}
--- step stmt return (t[0] - 5); --->
{
stack: main{(t[0] - 5)<-1> :: return (t[0] - 5);<0>} :: top{}
heap: fun<main>, 5, Int, 5, (0 = 5@3),
env: t: (0 = 5@3), main: fun<main>,
}
--- step exp (t[0] - 5) --->
{
stack: main{t[0]<-1> :: (t[0] - 5)<0> :: return (t[0] - 5);<0>} :: top{}
heap: fun<main>, 5, Int, 5, (0 = 5@3),
env: t: (0 = 5@3), main: fun<main>,
}
--- step exp t[0] --->
{
stack: main{t<-1> :: t[0]<0> :: (t[0] - 5)<0> :: return (t[0] - 5);<0>} :: top{}
heap: fun<main>, 5, Int, 5, (0 = 5@3),
env: t: (0 = 5@3), main: fun<main>,
}
--- step exp t --->
{
stack: main{(0 = 5@3)<-1> :: t[0]<0> :: (t[0] - 5)<0> :: return (t[0] - 5);<0>} :: top{}
heap: fun<main>, 5, Int, 5, (0 = 5@3),
env: t: (0 = 5@3), main: fun<main>,
}
--- handle value (0 = 5@3) with t[0]<1>((0 = 5@3),) --->
{
stack: main{0<-1> :: t[0]<1>((0 = 5@3),) :: (t[0] - 5)<0> :: return (t[0] - 5);<0>} :: top{}
heap: fun<main>, 5, Int, 5, (0 = 5@3),
env: t: (0 = 5@3), main: fun<main>,
}
--- step exp 0 --->
{
stack: main{0<-1> :: t[0]<1>((0 = 5@3),) :: (t[0] - 5)<0> :: return (t[0] - 5);<0>} :: top{}
heap: fun<main>, 5, Int, 5, (0 = 5@3),
env: t: (0 = 5@3), main: fun<main>,
}
--- handle value 0 with t[0]<2>((0 = 5@3),0,) --->
{
stack: main{5<-1> :: (t[0] - 5)<0> :: return (t[0] - 5);<0>} :: top{}
heap: fun<main>, 5, Int, 5, (0 = 5@3),
env: t: (0 = 5@3), main: fun<main>,
}
--- handle value 5 with (t[0] - 5)<1>(5,) --->
{
stack: main{5<-1> :: (t[0] - 5)<1>(5,) :: return (t[0] - 5);<0>} :: top{}
heap: fun<main>, 5, Int, 5, (0 = 5@3),
env: t: (0 = 5@3), main: fun<main>,
}
--- step exp 5 --->
{
stack: main{5<-1> :: (t[0] - 5)<1>(5,) :: return (t[0] - 5);<0>} :: top{}
heap: fun<main>, 5, Int, 5, (0 = 5@3),
env: t: (0 = 5@3), main: fun<main>,
}
--- handle value 5 with (t[0] - 5)<2>(5,5,) --->
{
stack: main{0<-1> :: return (t[0] - 5);<0>} :: top{}
heap: fun<main>, 5, Int, 5, (0 = 5@3),
env: t: (0 = 5@3), main: fun<main>,
}
--- handle value 0 with return (t[0] - 5);<1>(0,) --->
{
stack: top{0<-1>}
heap: fun<main>, 5, Int, !!5, !!(0 = !!5@3),
env: main: fun<main>,
}
result: 0