Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Spelling error #1234

Merged
merged 1 commit into from
Nov 15, 2016
Merged

Spelling error #1234

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion docs/csharp/expression-trees-interpreting.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -65,7 +65,7 @@ Expression<Func<int>> sum = () => 1 + 2;
> because the right-hand side of the assignment is implicitly typed. To understand
> this more deeply, read [here](implicitly-typed-lambda-expressions.md).

The root node is a `LambaExpression`. In order to get the interesting
The root node is a `LambdaExpression`. In order to get the interesting
code on the right hand side of the `=>` operator, you need to find one
of the children of the `LambdaExpression`. We'll do that with all the
expressions in this section. The parent node does help us find the return
Expand Down